{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T14:57:06Z","timestamp":1786978626058,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540454854","type":"print"},{"value":"9783540454878","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11875581_3","type":"book-chapter","created":{"date-parts":[[2006,9,25]],"date-time":"2006-09-25T08:23:29Z","timestamp":1159172609000},"page":"25-32","source":"Crossref","is-referenced-by-count":5,"title":["A More Effective Constructive Algorithm for Permutation Flowshop Problem"],"prefix":"10.1007","author":[{"given":"Xingye","family":"Dong","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Houkuan","family":"Huang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ping","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"3_CR1","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 multistage process in the minimum total time: a quick method of obtaining a near-optimum. Operational Research Quarterly\u00a016, 101\u2013107 (1965)","journal-title":"Operational Research Quarterly"},{"key":"3_CR2","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, 630\u2013637 (1970)","journal-title":"Management Science"},{"key":"3_CR3","doi-asserted-by":"crossref","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, 11\u201318 (1972)","journal-title":"AIIE, Transactions"},{"key":"3_CR4","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 flowshop sequence heuristics. Management Science\u00a023, 1174\u20131182 (1977)","journal-title":"Management Science"},{"key":"3_CR5","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.E., Ham, I.: A heuristic algorithm for the m-machine, n-job flowshop sequencing problem. OMEGA\u00a011, 91\u201395 (1983)","journal-title":"OMEGA"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/S0377-2217(97)00027-1","volume":"105","author":"C. Koulamas","year":"1998","unstructured":"Koulamas, C.: A new constructive heuristic for the flowshop scheduling problem. European Journal of Operational Research\u00a0105, 66\u201371 (1998)","journal-title":"European Journal of Operational Research"},{"key":"3_CR7","unstructured":"Li, X.P., Wang, Y.X., Wu, C.: Heuristic algorithms for large flowshop scheduling problems. In: Proceedings of the 5th world congress on intelligent control and automation, Hangzhou, China, pp. 2999\u20133003 (2004)"},{"issue":"3","key":"3_CR8","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/S0305-0548(97)00050-6","volume":"25","author":"H.S. Woo","year":"1998","unstructured":"Woo, H.S., Yim, D.S.: A heuristic algorithm for mean flowtime objective in flowshop scheduling. Computers & Operations Research\u00a025(3), 175\u2013182 (1998)","journal-title":"Computers & Operations Research"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1016\/S0377-2217(01)00278-8","volume":"141","author":"J.M. Framinan","year":"2002","unstructured":"Framinan, J.M., Leisten, R., Ruiz-Usano, R.: Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation. European Journal of Operational Research\u00a0141, 559\u2013569 (2002)","journal-title":"European Journal of Operational Research"},{"key":"3_CR10","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 minimisation in permutation flow shops. OMEGA\u00a031, 311\u2013317 (2003)","journal-title":"OMEGA"},{"key":"3_CR11","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":"3_CR12","volume-title":"Scheduling: theory, algorithms, and systems","author":"M. Pinedo","year":"2001","unstructured":"Pinedo, M.: Scheduling: theory, algorithms, and systems, 2nd edn. Prentice Hall, Englewood Cliffs (2001)","edition":"2"},{"issue":"1","key":"3_CR13","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 schedule with setup times included. Naval Research Logistics Quarterly\u00a01(1), 61\u201368 (1954)","journal-title":"Naval Research Logistics Quarterly"},{"key":"3_CR14","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"}],"container-title":["Lecture Notes in Computer Science","Intelligent Data Engineering and Automated Learning \u2013 IDEAL 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11875581_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:25:20Z","timestamp":1619493920000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11875581_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540454854","9783540454878"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11875581_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}