{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T20:36:18Z","timestamp":1725482178615},"publisher-location":"Boston, MA","reference-count":19,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387365909"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-0-387-36594-7_37","type":"book-chapter","created":{"date-parts":[[2007,3,7]],"date-time":"2007-03-07T17:50:17Z","timestamp":1173289817000},"page":"349-356","source":"Crossref","is-referenced-by-count":1,"title":["Iterative Heuristics for Permutation Flow Shops with Total Flowtime Minimization"],"prefix":"10.1007","author":[{"given":"Xiaoping","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qian","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"37_CR1","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/S0925-5273(01)00228-6","volume":"77","author":"A. Allahverdi","year":"2002","unstructured":"Allahverdi A, Aldowaisan T. New heuristics to minimize total completion time in m-machine flowshops. International Journal of Production Economics 2002; 77(1): 71\u201383.","journal-title":"International Journal of Production Economics"},{"key":"37_CR2","unstructured":"Baker KR. Introduction to sequencing and scheduling. New York: Wiley, 1974."},{"issue":"1","key":"37_CR3","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1080\/00207540210161650","volume":"41","author":"J.M. Framinan","year":"2003","unstructured":"Framinan JM, Leisten R, Rajendran C. Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem. International Journal of Production Research 2003; 41(1): 121\u2013148.","journal-title":"International Journal of Production Research"},{"issue":"5","key":"37_CR4","doi-asserted-by":"crossref","first-page":"1237","DOI":"10.1016\/j.cor.2003.11.002","volume":"32","author":"J.M. Framinan","year":"2005","unstructured":"Framinan JM, Leisten R, Ruiz-Usano R. Comparison of heuristics for flowtime minimisation in permutation flowshops. Computers & Operations Research 2005; 32(5): 1237\u20131254.","journal-title":"Computers & Operations Research"},{"issue":"4","key":"37_CR5","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 JM, Leisten R. An efficient constructive heuristic for flowtime minimisation in permutation flow shops. OMEGA 2003; 31(4): 311\u2013317.","journal-title":"OMEGA"},{"key":"37_CR6","volume-title":"Sequencing and scheduling: an introduction to the mathematics of the job-shop","author":"S. French","year":"1982","unstructured":"French S. Sequencing and scheduling: an introduction to the mathematics of the job-shop. Chichester: Ellis Horwood, 1982."},{"issue":"2","key":"37_CR7","first-page":"117","volume":"l","author":"M.R. Gray","year":"1976","unstructured":"Gray MR, Johnson DS, Sethi R. The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research 1976; l(2): 117\u2013129.","journal-title":"The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research"},{"issue":"1","key":"37_CR8","first-page":"11","volume":"4","author":"J.N.D. Gupta","year":"1972","unstructured":"Gupta JND. Heuristic algorithms for multistage flow shop problem. AIIE Transaction 1972; 4(1): 11\u201318.","journal-title":"Heuristic algorithms for multistage flow shop problem. AIIE Transaction"},{"issue":"3","key":"37_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 JC. Flowshop sequencing with mean flowtime objective. European Journal of Operational Research 1995; 81(3): 571\u2013578.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"37_CR10","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 CR. Constructive and composite heuristic solutions to the P\/\/ \u03a3Ci scheduling problem. European Journal of Operational Research 2001; 132(2): 439\u2013452.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"37_CR11","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"1 l","author":"M. Nawaz","year":"1983","unstructured":"Nawaz M, Enscore EE, Ham I. A heuristic algorithm for the m-machine n-job flow-shop sequencing problem. OMEGA 1983; 1 l(1): 91\u201395.","journal-title":"OMEGA"},{"issue":"2","key":"37_CR12","first-page":"318","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 1991; 61(2): 318\u2013325.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"37_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 ofjobs. European Journal of Operational Research 1997; 103(1): 129\u2013138.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"37_CR14","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 2004; 155(2): 426\u2013438.","journal-title":"European Journal of Operational Research"},{"issue":"11","key":"37_CR15","doi-asserted-by":"crossref","first-page":"2541","DOI":"10.1080\/00207549408957083","volume":"32","author":"C. Rajendran","year":"1994","unstructured":"Rajendran C. A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria. International Journal of Production Research 1994; 32(11): 2541\u20132558.","journal-title":"International Journal of Production Research"},{"issue":"1","key":"37_CR16","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 a flowshop to minimise total flowtime. International Journal of Production Economics 1993; 29(1): 65\u201373.","journal-title":"International Journal of Production Economics"},{"issue":"1","key":"37_CR17","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E. Tailard","year":"1993","unstructured":"Tailard E. Benchmarks for basic scheduling problems. European Journal of Operational Research 1993; 64(1): 278\u2013285.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"37_CR18","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 JM. Heuristic approaches for n\/m\/F\/\u2211C\n                  1 scheduling problems. European Journal of Operational Research 1997; 96(3): 636\u2013644.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"37_CR19","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 DS, Yim HS. A heuristic algorithm for mean flowtime objective in flowshop scheduling. Computers & Operations Research 1998; 25(3): 175\u2013182.","journal-title":"Computers & Operations Research"}],"container-title":["IFIP International Federation for Information Processing","Information Technology For Balanced Manufacturing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-36594-7_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:54:11Z","timestamp":1605650051000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-387-36594-7_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9780387365909"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-36594-7_37","relation":{},"subject":[]}}