{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,20]],"date-time":"2025-08-20T12:41:37Z","timestamp":1755693697429},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2008,6,8]],"date-time":"2008-06-08T00:00:00Z","timestamp":1212883200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sci. China Ser. F-Inf. Sci."],"published-print":{"date-parts":[[2008,7]]},"DOI":"10.1007\/s11432-008-0080-7","type":"journal-article","created":{"date-parts":[[2008,6,7]],"date-time":"2008-06-07T13:58:50Z","timestamp":1212847130000},"page":"896-909","source":"Crossref","is-referenced-by-count":13,"title":["Heuristic for no-wait flow shops with makespan minimization based on total idle-time increments"],"prefix":"10.1007","volume":"51","author":[{"given":"XiaoPing","family":"Li","sequence":"first","affiliation":[]},{"given":"Cheng","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,6,8]]},"reference":[{"issue":"3","key":"80_CR1","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1287\/opre.44.3.510","volume":"44","author":"N. G. Hall","year":"1996","unstructured":"Hall N G, Sriskndarajah C. A survey of machine scheduling problems with blocking and no-wait in process. Oper Res, 1996, 44(3): 510\u2013525","journal-title":"Oper Res"},{"issue":"2","key":"80_CR2","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"M. R. Gray","year":"1976","unstructured":"Gray M R, Johnson D S, Sethi R. The complexity of flowshop and jobshop scheduling. Math Oper Res, 1976, 1(2): 117\u2013129","journal-title":"Math Oper Res"},{"issue":"3","key":"80_CR3","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0925-5273(93)90042-J","volume":"32","author":"R. Gangadharan","year":"1993","unstructured":"Gangadharan R, Rajendran C. Heuristic algorithms for scheduling in the no-wait flowshop. Int J Prod Econ, 1993, 32(3): 285\u2013290","journal-title":"Int J Prod Econ"},{"issue":"4","key":"80_CR4","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1057\/jors.1994.65","volume":"45","author":"C. Rajendran","year":"1994","unstructured":"Rajendran C. A no-wait flowshop scheduling heuristic to minimize makespan. J Oper Res Soc, 1994, 45(4): 472\u2013478","journal-title":"J Oper Res Soc"},{"issue":"4","key":"80_CR5","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1057\/jors.1976.176","volume":"24","author":"M. C. Bonney","year":"1976","unstructured":"Bonney M C, Gundry S W. Solutions to the constrained flow-shop sequencing problem. Oper Res Q, 1976, 24(4): 869\u2013883","journal-title":"Oper Res Q"},{"issue":"3","key":"80_CR6","first-page":"343","volume":"18","author":"J. R. King","year":"1980","unstructured":"King J R, Spachis A S. Heuristics for flow-shop scheduling. Int J Pro Res, 1980, 18(3): 343\u2013357","journal-title":"Int J Pro Res"},{"issue":"8","key":"80_CR7","doi-asserted-by":"crossref","first-page":"1219","DOI":"10.1016\/S0305-0548(02)00068-0","volume":"30","author":"T. Aldowiasan","year":"2003","unstructured":"Aldowiasan T, Allahverdi A. New heuristics for no-wait flowshops to minimize makespan. Comp Oper Res, 2003, 30(8): 1219\u20131231","journal-title":"Comp Oper Res"},{"issue":"8","key":"80_CR8","doi-asserted-by":"crossref","first-page":"2197","DOI":"10.1016\/j.cor.2004.02.009","volume":"32","author":"J. Grabowski","year":"2005","unstructured":"Grabowski J, Pempera J. Some local search algorithms for no-wait flow-shop problem with makespam criterion. Comp Oper Res, 2005, 32(8): 2197\u20132213","journal-title":"Comp Oper Res"},{"issue":"2","key":"80_CR9","doi-asserted-by":"crossref","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. Eur J Oper Res, 1993, 64(2): 278\u2013285","journal-title":"Eur J Oper Res"},{"key":"80_CR10","unstructured":"Li X P, Wang Q, Wu C. Efficient Composite Heuristics for Total Flowtime Minimization in Permutation Flow Shops. Omega. Accepted. (In press, online)"},{"issue":"1","key":"80_CR11","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"11","author":"M. Nawaz","year":"1983","unstructured":"Nawaz M, Enscore E E, Ham I. A heuristic algorithm for the m-machine n-job flow-shop sequencing problem. Omega, 1983, 11(1): 91\u201395","journal-title":"Omega"},{"issue":"1","key":"80_CR12","doi-asserted-by":"crossref","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. Eur J Oper Res, 1997, 103(1): 129\u2013138","journal-title":"Eur J Oper Res"},{"issue":"4","key":"80_CR13","doi-asserted-by":"crossref","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 minimisation in permutation flow shops. Omega, 2003, 31(4): 311\u2013317","journal-title":"Omega"},{"issue":"5","key":"80_CR14","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 J M, Leisten R, Ruiz-Usano R. Comparison of heuristics for flowtime minimisation in permutation flowshops. Comp Oper Res, 2005, 32(5): 1237\u20131254","journal-title":"Comp Oper Res"},{"issue":"1","key":"80_CR15","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.omega.2005.03.003","volume":"35","author":"P. J. Kalczynski","year":"2007","unstructured":"Kalczynski P J, Kamburowski J. On the NEH heuristic for minimizing the makespan in permutation flow shops. Omega, 2007, 35(1): 53\u201360","journal-title":"Omega"},{"issue":"3","key":"80_CR16","doi-asserted-by":"crossref","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 flowtime objective in flowshop scheduling. Comp Oper Res, 1998, 25(3): 175\u2013182","journal-title":"Comp Oper Res"}],"container-title":["Science in China Series F: Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-008-0080-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-008-0080-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-008-0080-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T15:35:55Z","timestamp":1559403355000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-008-0080-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6,8]]},"references-count":16,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2008,7]]}},"alternative-id":["80"],"URL":"https:\/\/doi.org\/10.1007\/s11432-008-0080-7","relation":{},"ISSN":["1009-2757","1862-2836"],"issn-type":[{"value":"1009-2757","type":"print"},{"value":"1862-2836","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,6,8]]}}}