{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T18:15:25Z","timestamp":1725732925831},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642396458"},{"type":"electronic","value":"9783642396465"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39646-5_19","type":"book-chapter","created":{"date-parts":[[2013,6,21]],"date-time":"2013-06-21T05:20:18Z","timestamp":1371792018000},"page":"258-270","source":"Crossref","is-referenced-by-count":0,"title":["Improved Flow Shop Schedules with Total Completion Time Criterion"],"prefix":"10.1007","author":[{"given":"Dipak","family":"Laha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dhiren Kumar","family":"Behera","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","volume-title":"Introduction to sequencing and scheduling","author":"K.R. Baker","year":"1974","unstructured":"Baker, K.R.: Introduction to sequencing and scheduling. John Wiley, New York (1974)"},{"key":"19_CR2","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, E., Ham, I.: A heuristic algorithm for the m\u2013 machine, n\u2013job flowshop sequencing problem. Omega\u00a011, 91\u201395 (1983)","journal-title":"Omega"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1016\/S0377-2217(02)00908-6","volume":"155","author":"C. Rajendran","year":"2004","unstructured":"Rajendran, C., Ziegler, H.: Ant-colony algorithms for permutation flowshop scheduling to minimize makespan\/total flowtime of jobs. European Journal of Operational Research\u00a0155, 426\u2013438 (2004)","journal-title":"European Journal of Operational Research"},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1016\/j.engappai.2006.10.003","volume":"20","author":"D. Laha","year":"2007","unstructured":"Laha, D., Chakraborty, U.K.: An efficient stochastic hybrid heuristic for flowshop scheduling. Engineering Applications of Artificial Intelligence\u00a020, 851\u2013856 (2007)","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1016\/j.ejor.2004.06.039","volume":"169","author":"A. Agarwal","year":"2006","unstructured":"Agarwal, A., Colak, S., Eryarsoy, E.: Improvement heuristic for the flow-shop scheduling problem. European Journal of Operational Research\u00a0169, 801\u2013815 (2006)","journal-title":"European Journal of Operational Research"},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0305-0483(93)90055-P","volume":"21","author":"S. Sarin","year":"1993","unstructured":"Sarin, S., Lefoka, M.: Scheduling heuristic for the n-job m-machine flow shop. Omega\u00a021, 229\u2013234 (1993)","journal-title":"Omega"},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1287\/opre.26.1.36","volume":"26","author":"T. Gonzalez","year":"1978","unstructured":"Gonzalez, T., Sahni, S.: Flow shop and job shop scheduling: complexity & approximation. Operations Research\u00a026, 36\u201352 (1978)","journal-title":"Operations Research"},{"key":"19_CR8","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 flow shop problem. AIIE Transaction\u00a04, 11\u201318 (1972)","journal-title":"AIIE Transaction"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1016\/0377-2217(93)E0353-Y","volume":"81","author":"J.C. Ho","year":"1995","unstructured":"Ho, J.C.: Flowshop sequencing with mean flow time objective. European Journal of Operational Research\u00a081, 571\u2013578 (1995)","journal-title":"European Journal of Operational Research"},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1016\/0377-2217(95)00347-9","volume":"96","author":"C. Wang","year":"1997","unstructured":"Wang, C., Chu, C., Proth, J.M.: Heuristic approaches for n\/m\/F\/(Ci scheduling problems. European Journal of Operational Research\u00a096, 636\u2013644 (1997)","journal-title":"European Journal of Operational Research"},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1016\/0377-2217(92)90361-C","volume":"61","author":"C. Rajendran","year":"1991","unstructured":"Rajendran, C., Chaudhuri, D.: An efficient heuristic approach to the scheduling of jobs in a flowshop. European Journal of Operational Research\u00a061, 318\u2013325 (1991)","journal-title":"European Journal of Operational Research"},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0925-5273(93)90024-F","volume":"29","author":"C. Rajendran","year":"1993","unstructured":"Rajendran, C.: Heuristic algorithm for scheduling in flowshop to minimize total flow time. International Journal of Production Economics\u00a029, 65\u201373 (1993)","journal-title":"International Journal of Production Economics"},{"key":"19_CR13","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S0377-2217(96)00273-1","volume":"103","author":"C. Rajendran","year":"1997","unstructured":"Rajendran, C., Ziegler, H.: An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs. European Journal of Operational Research\u00a0103, 129\u2013138 (1997)","journal-title":"European Journal of Operational Research"},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/S0305-0548(97)00050-6","volume":"25","author":"D.S. Woo","year":"1998","unstructured":"Woo, D.S., Yim, H.S.: A heuristic algorithm for mean flow time objective in flowshop scheduling. Computers and Operations Research\u00a025, 175\u2013182 (1998)","journal-title":"Computers and Operations Research"},{"key":"19_CR15","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/S0377-2217(00)00137-5","volume":"132","author":"J. Liu","year":"2001","unstructured":"Liu, J., Reeves, C.R.: Constructive and composite heuristics solution of the P\u2009\u2225\u2009\u2211\u2009C\n                  \n                    i\n                   scheduling problem. European Journal of Operational Research\u00a0132, 439\u2013452 (2001)","journal-title":"European Journal of Operational Research"},{"key":"19_CR16","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/S0305-0483(03)00047-1","volume":"31","author":"J.M. Framinan","year":"2003","unstructured":"Framinan, J.M., Leisten, R.: An efficient constructive heuristic for flowtime minimization in permutation flowshops. Omega\u00a031, 311\u2013317 (2003)","journal-title":"Omega"},{"key":"19_CR17","doi-asserted-by":"publisher","first-page":"734","DOI":"10.1016\/j.omega.2008.05.002","volume":"37","author":"D. Laha","year":"2009","unstructured":"Laha, D., Sarin, S.C.: A heuristic to minimize total flow time in permutation flow shop. Omega\u00a037, 734\u2013739 (2009)","journal-title":"Omega"},{"key":"19_CR18","doi-asserted-by":"publisher","first-page":"1189","DOI":"10.1007\/s00170-010-2895-9","volume":"53","author":"D. Laha","year":"2010","unstructured":"Laha, D., Chakravorty, A.: A new heuristic for minimizing total completion time objective in permutation flow shop scheduling. International Journal of Advanced Manufacturing Technology\u00a053, 1189\u20131197 (2010)","journal-title":"International Journal of Advanced Manufacturing Technology"},{"key":"19_CR19","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":"19_CR20","volume-title":"Advanced Engineering Mathematics","author":"E. Kreyszig","year":"1972","unstructured":"Kreyszig, E.: Advanced Engineering Mathematics. John Wiley, New York (1972)"},{"key":"19_CR21","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0377-2217(90)90090-X","volume":"47","author":"E. Taillard","year":"1990","unstructured":"Taillard, E.: Some efficient heuristic methods for the flow shop sequencing problem. European Journal of Operational Research\u00a047, 65\u201374 (1990)","journal-title":"European Journal of Operational Research"},{"key":"19_CR22","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.omega.2006.11.003","volume":"37","author":"X. Li","year":"2009","unstructured":"Li, X., Wang, Q., Wu, C.: Efficient composite heuristics for total flowtime minimization in permutation flowshops. Omega\u00a037, 155\u2013164 (2009)","journal-title":"Omega"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39646-5_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T09:06:32Z","timestamp":1557824792000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39646-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642396458","9783642396465"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39646-5_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}