{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,31]],"date-time":"2025-08-31T23:11:36Z","timestamp":1756681896767},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642032103"},{"type":"electronic","value":"9783642032110"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03211-0_13","type":"book-chapter","created":{"date-parts":[[2009,10,3]],"date-time":"2009-10-03T21:49:10Z","timestamp":1254606550000},"page":"153-164","source":"Crossref","is-referenced-by-count":2,"title":["Genetic Algorithm for Tardiness Minimization in Flowshop with Blocking"],"prefix":"10.1007","author":[{"given":"Tiago","family":"de O. Januario","sequence":"first","affiliation":[]},{"given":"Jos\u00e9 Elias C.","family":"Arroyo","sequence":"additional","affiliation":[]},{"given":"Mayron C\u00e9sar O.","family":"Moreira","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1057\/palgrave.jors.2601563","volume":"54","author":"J. Alcaraz","year":"2003","unstructured":"Alcaraz, J., Maroto, C., Ruiz, R.: Solving the multi-mode resource-constrained project scheduling problem with genetic algorithms. Journal of the Operational Research Society\u00a054, 614\u2013626 (2003)","journal-title":"Journal of the Operational Research Society"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/S0305-0548(98)00060-4","volume":"26","author":"V. Armentano","year":"1999","unstructured":"Armentano, V., Ronconi, D.: Tabu search for total tardiness minimization in flowshop scheduling problems. Computers And Operations Research\u00a026, 219\u2013235 (1999)","journal-title":"Computers And Operations Research"},{"key":"13_CR3","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1590\/S0104-530X2000000300011","volume":"7","author":"V. Armentano","year":"2000","unstructured":"Armentano, V., Ronconi, D.: Minimiza\u00e7\u00e3o do tempo total de atraso no problema de flowshop com buffer zero atrav\u00e9s de busca tabu. Gest\u00e3o e Produ\u00e7\u00e3o\u00a07, 352\u2013363 (2000)","journal-title":"Gest\u00e3o e Produ\u00e7\u00e3o"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1057\/palgrave.jors.2601220","volume":"52","author":"V. Armentano","year":"2001","unstructured":"Armentano, V., Ronconi, D.: Lower bounding schemes for flowshops with blocking in-process. Journal of the Operational Research Society\u00a052, 1289\u20131297 (2001)","journal-title":"Journal of the Operational Research Society"},{"issue":"13","key":"13_CR5","doi-asserted-by":"publisher","first-page":"1243","DOI":"10.1057\/palgrave.jors.2601784","volume":"55","author":"J.M. Framinan","year":"2004","unstructured":"Framinan, J.M., Gupta, J.N.D., Leisten, R.: A review and classification of heuristics for permutation flow-shop scheduling with makespan objective. Journal of the Operational Research Society\u00a055(13), 1243\u20131255 (2004)","journal-title":"Journal of the Operational Research Society"},{"key":"13_CR6","first-page":"1","volume-title":"Interfaces in Computer Science and Operations Research","author":"F. Glover","year":"1996","unstructured":"Glover, F.: Tabu search and adaptive memory programming - advances, applications, and challenges. In: Barr, R., Helgason, R., Kenngington, J. (eds.) Interfaces in Computer Science and Operations Research, pp. 1\u201375. Kluwer Academic Publishers, Dordrecht (1996)"},{"issue":"3","key":"13_CR7","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1016\/j.ejor.2005.02.001","volume":"127","author":"J.N. Gupta","year":"2006","unstructured":"Gupta, J.N., Stafford, E.J.: Flowshop scheduling research after five decades. European Journal of Operational Research\u00a0127(3), 699\u2013711 (2006)","journal-title":"European Journal of Operational Research"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1287\/opre.44.3.510","volume":"44","author":"N. Hall","year":"1996","unstructured":"Hall, N., Sriskandarajah, C.: A survey of machine scheduling problems with blocking and no-wait in process. Operations Research\u00a044, 510\u2013525 (1996)","journal-title":"Operations Research"},{"issue":"11","key":"13_CR9","doi-asserted-by":"publisher","first-page":"2289","DOI":"10.1080\/00207540310001657595","volume":"42","author":"S. Hasija","year":"2004","unstructured":"Hasija, S., Rajendran, C.: Scheduling in flowshops to minimize total tardiness of jobs. International Journal of Production Research\u00a042(11), 2289\u20132301 (2004)","journal-title":"International Journal of Production Research"},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1016\/0377-2217(93)E0235-P","volume":"81","author":"H. Ischibuchi","year":"1995","unstructured":"Ischibuchi, H., Tanaka, S.: Modified simulated annealing algorithm for the flow shop sequencing problems. European Journal of Operational Research\u00a081, 388\u2013398 (1995)","journal-title":"European Journal of Operational Research"},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1016\/S0305-0548(03)00016-9","volume":"31","author":"S. Iyera","year":"2004","unstructured":"Iyera, S., Saxena, B.: Improved genetic algorithm for the permutation flowshop scheduling problem. Computers and Operations Research\u00a031, 593\u2013606 (2004)","journal-title":"Computers and Operations Research"},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"61","author":"S. Johnson","year":"1954","unstructured":"Johnson, S.: Optimal two and three-stage production schedules with set-up times included. Naval Research Logistics Quarterly\u00a061, 61\u201368 (1954)","journal-title":"Naval Research Logistics Quarterly"},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.omega.2005.03.003","volume":"35","author":"P. Kalczynski","year":"2007","unstructured":"Kalczynski, P., Kamburowski, J.: On the neh heuristic for minimizing the makespan in permutation flowshops. OMEGA\u00a035, 53\u201360 (2007)","journal-title":"OMEGA"},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1016\/0377-2217(94)00029-C","volume":"85","author":"Y. Kim","year":"1995","unstructured":"Kim, Y.: Minimizing total tardiness in permutation flowshops. European Journal of Operational Research\u00a085, 541\u2013555 (1995)","journal-title":"European Journal of Operational Research"},{"key":"13_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03315-9","volume-title":"Genetic algorithms + data structures = evolution programs","author":"Z. Michalewicz","year":"1996","unstructured":"Michalewicz, Z.: Genetic algorithms + data structures = evolution programs, 3rd edn. Springer, London (1996)","edition":"3"},{"key":"13_CR16","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"11","author":"M. Nawaz","year":"1983","unstructured":"Nawaz, M., Enscore, E., Ham, I.: A heuristic algorithm for the m-machine, n-job flowshop sequencing problem. OMEGA\u00a011, 91\u201395 (1983)","journal-title":"OMEGA"},{"issue":"2","key":"13_CR17","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1016\/S0360-8352(97)00139-3","volume":"34","author":"S. Parthasarathy","year":"1998","unstructured":"Parthasarathy, S., Rajendran, C.: Scheduling to minimize mean tardiness and weighted mean tardiness in flowshop and flowline-based manufacturing cell. Comput. Ind. Eng.\u00a034(2), 531\u2013546 (1998)","journal-title":"Comput. Ind. Eng."},{"key":"13_CR18","first-page":"5","volume":"22","author":"C. Reeves","year":"1995","unstructured":"Reeves, C.: A genetic algorithm for flow shop scheduling. Operations Research\u00a022, 5\u201313 (1995)","journal-title":"Operations Research"},{"key":"13_CR19","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/0-306-48056-5_8","volume-title":"Handbook of Metaheuristics","author":"M. Resende","year":"2003","unstructured":"Resende, M., Ribeiro, C.: Greedy randomized adaptive search procedures. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 219\u2013249. Kluwer Academic Publishers, Dordrecht (2003)"},{"key":"13_CR20","unstructured":"Rinnooy Kan, A.H.G.: Machine Scheduling Problems: Classification, Complexity and Computations. Martinus Nijhoff, The Hague,Holland (1976)"},{"key":"13_CR21","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s10479-005-2444-3","volume":"138","author":"D.P. Ronconi","year":"2005","unstructured":"Ronconi, D.P.: A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking. Annals of Operations Research\u00a0138, 53\u201365 (2005)","journal-title":"Annals of Operations Research"},{"key":"13_CR22","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/j.omega.2007.01.003","volume":"37","author":"D.P. Ronconi","year":"2009","unstructured":"Ronconi, D.P., Henriques, L.: Some heuristic algorithms for total tardiness minimization in a flowshop with blocking. OMEGA\u00a037, 271\u2013281 (2009)","journal-title":"OMEGA"},{"key":"13_CR23","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1016\/j.omega.2004.12.006","volume":"34","author":"R. Ruiz","year":"2006","unstructured":"Ruiz, R., Maroto, C., Alcaraz, J.: Two new robust genetic algorithms for the flowshop scheduling problem. OMEGA\u00a034, 461\u2013476 (2006)","journal-title":"OMEGA"},{"key":"13_CR24","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0305-0483(84)90011-2","volume":"12","author":"T. Sen","year":"1984","unstructured":"Sen, T., Gupta, S.: A state-of-art survey of static scheduling research involving due date. OMEGA\u00a012, 63\u201376 (1984)","journal-title":"OMEGA"}],"container-title":["Studies in Computational Intelligence","Nature Inspired Cooperative Strategies for Optimization (NICSO 2008)"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03211-0_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T22:36:56Z","timestamp":1552171016000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03211-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642032103","9783642032110"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03211-0_13","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2009]]}}}