{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,12]],"date-time":"2025-03-12T06:10:06Z","timestamp":1741759806673,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642243547"},{"type":"electronic","value":"9783642243554"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-24355-4_2","type":"book-chapter","created":{"date-parts":[[2011,9,28]],"date-time":"2011-09-28T14:39:39Z","timestamp":1317220779000},"page":"11-18","source":"Crossref","is-referenced-by-count":1,"title":["Hybrid GA-Based Improvement Heuristic with Makespan Criterion for Flow-Shop Scheduling Problems"],"prefix":"10.1007","author":[{"given":"Pavol","family":"Seman\u010do","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vladim\u00edr","family":"Modr\u00e1k","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","volume-title":"Scheduling: Theory, Algorithms and Systems","author":"M. Pinedo","year":"2008","unstructured":"Pinedo, M.: Scheduling: Theory, Algorithms and Systems. Springer, New Jersey (2008)"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Gupta, J.N.D.: Analysis of Combinatorial Approach to Flowshop Scheduling Problems (1975)","DOI":"10.1057\/jors.1975.195"},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"S.M. Johnson","year":"1954","unstructured":"Johnson, S.M.: Optimal Two and Three Stage Production Schedules with Set-Up Times. Naval Research Logistics Quarterly\u00a01, 61\u201368 (1954)","journal-title":"Naval Research Logistics Quarterly"},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"M.R.D. Garey","year":"1976","unstructured":"Garey, M.R.D., Johnson, D.S., Sethi, R.: The Complexity of Flowshop and Jobshop Scheduling. Mathematics of Operations Research\u00a01, 117\u2013129 (1976)","journal-title":"Mathematics of Operations Research"},{"key":"2_CR5","volume-title":"Theory of Scheduling","author":"R.W. Conway","year":"1967","unstructured":"Conway, R.W., Maxwell, W.L., Miller, L.W.: Theory of Scheduling. Addison-Wesley, Reading (1967)"},{"issue":"14","key":"2_CR6","doi-asserted-by":"publisher","first-page":"2895","DOI":"10.1080\/0020754050056417","volume":"43","author":"S.R. Hejazi","year":"2005","unstructured":"Hejazi, S.R., Saghafian, S.: Flowshop Scheduling Problems with Makespan Criterion: A Review. International Journal of Production Research\u00a043(14), 2895\u20132929 (2005)","journal-title":"International Journal of Production Research"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1057\/jors.1965.8","volume":"16","author":"D.S. Palmer","year":"1965","unstructured":"Palmer, D.S.: Sequencing Jobs through a Multi-Stage Process in the Minimum Total Time - A Quick Method of Obtaining a Near Optimum. Opers. Res. Q\u00a016, 101\u2013107 (1965)","journal-title":"Opers. Res. Q"},{"issue":"10","key":"2_CR8","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1287\/mnsc.16.10.B630","volume":"16","author":"H.G. Campbell","year":"1970","unstructured":"Campbell, H.G., Dudek, R.A., Smith, M.L.: A Heuristic Algorithm for the n Job, m Machine Sequencing Problem. Management Science\u00a016(10), 630\u2013637 (1970)","journal-title":"Management Science"},{"issue":"11","key":"2_CR9","doi-asserted-by":"publisher","first-page":"1174","DOI":"10.1287\/mnsc.23.11.1174","volume":"23","author":"D.G. Dannenbring","year":"1977","unstructured":"Dannenbring, D.G.: An Evaluation of Flow Shop Sequencing Heuristics. Management Science\u00a023(11), 1174\u20131182 (1977)","journal-title":"Management Science"},{"issue":"1","key":"2_CR10","first-page":"109","volume":"49","author":"P. Brucker","year":"1994","unstructured":"Brucker, P., Jurisch, B., Sievers, B.: A Branch and Bound Algorithm for the Job Shop Scheduling Problem. Discrete Applied Mathematics\u00a049(1), 109\u2013127 (1994)","journal-title":"Discrete Applied Mathematics"},{"issue":"2-3","key":"2_CR11","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1016\/S0377-2217(97)00289-0","volume":"106","author":"M. Gendreau","year":"1998","unstructured":"Gendreau, M., Laporte, G., Semet, F.: A Tabu Search Heuristic for the Undirected Selective Travelling Salesman Problem. European Journal of Operational Research\u00a0106(2-3), 539\u2013545 (1998)","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"2_CR12","doi-asserted-by":"publisher","first-page":"1061","DOI":"10.1016\/0360-8352(96)00053-8","volume":"30","author":"T. Murata","year":"1996","unstructured":"Murata, T., Ishibuchi, H., Tanaka, H.: Genetic algorithms for flowshop scheduling problems. Computers & Industrial Engineering\u00a030(4), 1061\u20131071 (1996)","journal-title":"Computers & Industrial Engineering"},{"issue":"2","key":"2_CR13","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1287\/mnsc.44.2.262","volume":"44","author":"E. Balas","year":"1998","unstructured":"Balas, E., Vazacopoulos, A.: Guided Local Search with Shifting Bottleneck for Job Shop Scheduling. Management Science\u00a044(2), 262\u2013275 (1998)","journal-title":"Management Science"},{"issue":"3","key":"2_CR14","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1023\/B:JMMA.0000038614.39977.6f","volume":"3","author":"C. Blum","year":"2004","unstructured":"Blum, C., Sampels, M.: An Ant Colony Optimization Algorithm for Shop Scheduling Problems. Journal of Mathematical Modelling and Algorithms\u00a03(3), 285\u2013308 (2004)","journal-title":"Journal of Mathematical Modelling and Algorithms"},{"key":"2_CR15","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1111\/j.2517-6161.1961.tb00432.x","volume":"23","author":"E.S. Page","year":"1961","unstructured":"Page, E.S.: An approach to scheduling of jobs on the machines. J. Royal Stat. Soc.\u00a023, 484\u2013492 (1961)","journal-title":"J. Royal Stat. Soc."},{"issue":"1","key":"2_CR16","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1080\/05695557208974823","volume":"4","author":"J.N.D. Gupta","year":"1972","unstructured":"Gupta, J.N.D.: Heuristic Algorithms for Multistage Flowshop Scheduling Problem. AIIE Transactions\u00a04(1), 11\u201318 (1972)","journal-title":"AIIE Transactions"},{"issue":"1","key":"2_CR17","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"11","author":"M.E. Nawaz","year":"1983","unstructured":"Nawaz, M.E., Enscore, I., Ham, I.: A Heuristic Algorithm for the m Machine, n Job Flow Shop Sequence Problem. OMEGA\u00a011(1), 91\u201395 (1983)","journal-title":"OMEGA"},{"key":"2_CR18","doi-asserted-by":"publisher","first-page":"985","DOI":"10.1016\/j.ejor.2006.06.060","volume":"187","author":"A. Allahverdi","year":"2008","unstructured":"Allahverdi, A., Ng, C.T., Cheng, T.C.E., Kovalyov, M.Y.: A Survey of Scheduling Problems with Setup Times or Costs. European Journal of Operational Research\u00a0187, 985\u20131032 (2008)","journal-title":"European Journal of Operational Research"},{"key":"2_CR19","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1504\/EJIE.2007.015388","volume":"1","author":"S.H. Hendizadeh","year":"2007","unstructured":"Hendizadeh, S.H., ElMekkawy, T.Y., Wang, G.G.: Bi-Criteria Scheduling of a Flowshop Manufacturing Cell with Sequence Dependent Setup Time. European Journal of Industrial Engineering\u00a01, 391\u2013413 (2007)","journal-title":"European Journal of Industrial Engineering"},{"issue":"4","key":"2_CR20","doi-asserted-by":"publisher","first-page":"1249","DOI":"10.1016\/j.cor.2008.01.007","volume":"36","author":"G.I. Zobolas","year":"2009","unstructured":"Zobolas, G.I., Tarantilis, C.D., Ioannou, G.: Minimizing Makespan in Permutation Flow Shop Scheduling Problems Using a Hybrid Metaheuristic Algorithm. Computers and Operations Research\u00a036(4), 1249\u20131267 (2009)","journal-title":"Computers and Operations Research"},{"key":"2_CR21","doi-asserted-by":"publisher","first-page":"3243","DOI":"10.1016\/0305-0548(90)90001-N","volume":"17","author":"F.A. Ogbu","year":"1990","unstructured":"Ogbu, F.A., Smith, D.K.: The Application of the Simulated Annealing Algorithm to the Solution of the n\/m\/Cmax Flowshop Problem. Computers & Operations Research\u00a017, 3243\u20133253 (1990)","journal-title":"Computers & Operations Research"},{"key":"2_CR22","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E. Taillard","year":"1993","unstructured":"Taillard, E.: Benchmarks for basic scheduling problems. European Journal of Operational Research\u00a064, 278\u2013285 (1993)","journal-title":"European Journal of Operational Research"},{"key":"2_CR23","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/BF02125405","volume":"63","author":"A. Nagar","year":"1996","unstructured":"Nagar, A., Heragu, S.S., Haddock, J.: A Combined Branch-and-Bound and Genetic Algorithm Based Approach for a Flowshop-Scheduling Problem. Annal. Oper. Res.\u00a063, 397\u2013414 (1996)","journal-title":"Annal. Oper. Res."},{"key":"2_CR24","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1016\/0377-2217(95)00275-8","volume":"95","author":"V.R. Neppalli","year":"1996","unstructured":"Neppalli, V.R., Chen, C.L., Gupta, J.N.D.: Genetic Algorithms for the Two-Stage Bicriteria Flowshop Problem. Eur. J. Oper. Res.\u00a095, 356\u2013373 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"2_CR25","doi-asserted-by":"publisher","first-page":"1083","DOI":"10.1016\/j.future.2004.03.014","volume":"20","author":"O. Engin","year":"2004","unstructured":"Engin, O., Doyen, A.: A New Approach to Solve Hybrid Flow Shop Scheduling Problems by Artificial Immune System. Future Generation Computer Systems\u00a020, 1083\u20131095 (2004)","journal-title":"Future Generation Computer Systems"},{"issue":"8","key":"2_CR26","doi-asserted-by":"publisher","first-page":"1439","DOI":"10.1016\/j.cor.2009.11.001","volume":"37","author":"R. Ribas","year":"2010","unstructured":"Ribas, R., Leisten, J.M.: Review and Classification of Hybrid Flow Shop Scheduling Problems from a Production System and a Solutions Procedure Perspective. Computers and Operations Research\u00a037(8), 1439\u20131454 (2010)","journal-title":"Computers and Operations Research"}],"container-title":["Communications in Computer and Information Science","ENTERprise Information Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24355-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,12]],"date-time":"2025-03-12T05:20:03Z","timestamp":1741756803000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24355-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642243547","9783642243554"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24355-4_2","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2011]]}}}