{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:44:04Z","timestamp":1725522244991},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540927181"},{"type":"electronic","value":"9783540927198"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-92719-8_18","type":"book-chapter","created":{"date-parts":[[2008,12,17]],"date-time":"2008-12-17T14:17:41Z","timestamp":1229523461000},"page":"192-203","source":"Crossref","is-referenced-by-count":2,"title":["Hybrid Heuristic for m-Machine No-Wait Flowshops to Minimize Total Completion Time"],"prefix":"10.1007","author":[{"given":"Xia","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"XiaoPing","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qian","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","volume-title":"Scheduling: theory, algorithm, and systems","author":"M. Pinedo","year":"1995","unstructured":"Pinedo, M.: Scheduling: theory, algorithm, and systems. Prentice-Hall, Englewood Chills (1995)"},{"issue":"3","key":"18_CR2","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1287\/opre.44.3.510","volume":"44","author":"N.G. Hall","year":"1996","unstructured":"Hall, N.G., Sriskandarajah, C.: A survey of machine scheduling problems with blocking and no-wait in process. Operations Research\u00a044(3), 510\u2013525 (1996)","journal-title":"Operations Research"},{"key":"18_CR3","doi-asserted-by":"publisher","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. Journal of the Operational Research Society\u00a045, 472\u2013478 (1994)","journal-title":"Journal of the Operational Research Society"},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1016\/S0377-2217(99)00224-6","volume":"125","author":"J. Grabowski","year":"2000","unstructured":"Grabowski, J., Pempera, J.: Sequencing of jobs in some production system. European Journal of Operational Research\u00a0125, 535\u2013550 (2000)","journal-title":"European Journal of Operational Research"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/S0377-2217(99)00285-4","volume":"126","author":"W. Raaymakers","year":"2000","unstructured":"Raaymakers, W., Hoogeveen, J.: Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing. European Journal of Operational Research\u00a0126, 131\u2013151 (2000)","journal-title":"European Journal of Operational Research"},{"key":"18_CR6","doi-asserted-by":"publisher","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\u00a032, 2541\u20132558 (1994)","journal-title":"International Journal of Production Research"},{"key":"18_CR7","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco (1979)"},{"issue":"1","key":"18_CR8","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1080\/05695557408974929","volume":"6","author":"J.M. Deman Van","year":"1974","unstructured":"Van Deman, J.M., Baker, K.R.: Minimizing Mean Flow Time in the Flowshop with No Intermediate Queues. AIIE Transactions\u00a06(1), 28\u201334 (1974)","journal-title":"AIIE Transactions"},{"issue":"3","key":"18_CR9","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1002\/nav.3800290311","volume":"29","author":"I. Adiri","year":"1982","unstructured":"Adiri, I., Pohoryles, D.: Flowshop\/no-idle or no-wait scheduling to minimize the sum of completion times. Navel Research Logistics Quarterly\u00a029(3), 495\u2013504 (1982)","journal-title":"Navel Research Logistics Quarterly"},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"971","DOI":"10.1057\/jors.1991.187","volume":"42","author":"J.A.A. Veen Van der","year":"1991","unstructured":"Van der Veen, J.A.A., Van Dal, R.: Solvable cases of the no-wait flowshop scheduling problem. Journal of the Operational Research Society\u00a042, 971\u2013980 (1991)","journal-title":"Journal of the Operational Research Society"},{"key":"18_CR11","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1016\/S0305-0548(98)00002-1","volume":"25","author":"T. Aldowiasan","year":"1998","unstructured":"Aldowiasan, T., Allahverdi, A.: Total flowtime in no-wait flowshops with separated setup times. Computers & Operations Research\u00a025, 757\u2013765 (1998)","journal-title":"Computers & Operations Research"},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1016\/S0305-0548(99)00136-7","volume":"28","author":"T. Aldowiasan","year":"2000","unstructured":"Aldowiasan, T.: A new heuristic and dominance relations for no-wait flowshops with setups. Computers & Operations Research\u00a028, 563\u2013584 (2000)","journal-title":"Computers & Operations Research"},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1111\/j.1475-3995.2000.tb00197.x","volume":"7","author":"A. Allahverdi","year":"2000","unstructured":"Allahverdi, A., Aldowaisan, T.: No-wait and separate setup three-machine flowshop with total completion time criterion. International Transactions in Operational Research\u00a07, 245\u2013264 (2000)","journal-title":"International Transactions in Operational Research"},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1002\/1520-6750(199010)37:5<695::AID-NAV3220370508>3.0.CO;2-L","volume":"37","author":"C. Rajendran","year":"1990","unstructured":"Rajendran, C., Chaudhuri, D.: Heuristic algorithms for continuous flow-shop problem. Naval Research Logistics\u00a037, 695\u2013705 (1990)","journal-title":"Naval Research Logistics"},{"key":"18_CR15","doi-asserted-by":"publisher","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. Quart.\u00a024, 869\u2013883 (1976)","journal-title":"Oper. Res. Quart."},{"key":"18_CR16","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. Prod. Res.\u00a018, 343\u2013357 (1980)","journal-title":"Int. J. Prod. Res."},{"issue":"1-3","key":"18_CR17","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1016\/S0924-0136(00)00720-2","volume":"107","author":"E. Bertolissi","year":"2000","unstructured":"Bertolissi, E.: Heuristic algorithm for scheduling in the no-wait flow-shop. Journal of Materials Processing Technology\u00a0107(1-3), 459\u2013465 (2000)","journal-title":"Journal of Materials Processing Technology"},{"key":"18_CR18","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/j.omega.2004.01.004","volume":"32","author":"T. Aldowaisan","year":"2004","unstructured":"Aldowaisan, T., Allahverdi, A.: New heuristics for m-machine no-wait flowshop to minimize total completion time. OMEGA\u00a032, 345\u2013352 (2004)","journal-title":"OMEGA"},{"issue":"1","key":"18_CR19","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 flow-shop sequencing problem. OMEGA\u00a011(1), 91\u201395 (1983)","journal-title":"OMEGA"},{"issue":"4","key":"18_CR20","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 flow shops. OMEGA\u00a031(4), 311\u2013317 (2003)","journal-title":"OMEGA"},{"issue":"21","key":"18_CR21","first-page":"3656","volume":"18","author":"X. Gao","year":"2005","unstructured":"Gao, X., Li, X., Zhang, H.: A Heuristic for Total Flowtime Minimization in Flow shop Scheduling. Proceedings of Machine Learning and Cybernetics\u00a018(21), 3656\u20133660 (2005)","journal-title":"Proceedings of Machine Learning and Cybernetics"},{"key":"18_CR22","doi-asserted-by":"publisher","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 minimization in permutation flowshops. Computer & Operations Research\u00a032, 1237\u20131254 (2005)","journal-title":"Computer & Operations Research"},{"key":"18_CR23","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., Simth, M.L.: A heuristic algorithm for the n-job m-machine sequencing problem. Management Science\u00a016, B630\u2013B637 (1970)","journal-title":"Management Science"},{"key":"18_CR24","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","Computer Supported Cooperative Work in Design IV"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92719-8_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T13:50:26Z","timestamp":1551707426000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92719-8_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540927181","9783540927198"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92719-8_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}