{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T08:24:20Z","timestamp":1743063860382,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642259432"},{"type":"electronic","value":"9783642259449"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-25944-9_6","type":"book-chapter","created":{"date-parts":[[2012,1,3]],"date-time":"2012-01-03T01:15:12Z","timestamp":1325553312000},"page":"41-48","source":"Crossref","is-referenced-by-count":3,"title":["Two Techniques to Improve the NEH Algorithm for Flow-Shop Scheduling Problems"],"prefix":"10.1007","author":[{"given":"Gengcheng","family":"Liu","sequence":"first","affiliation":[]},{"given":"Shiji","family":"Song","sequence":"additional","affiliation":[]},{"given":"Cheng","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"6_CR1","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 Schedules with Setup Times Included. Naval Research Logistics Quarterly\u00a01(1), 61\u201368 (1954)","journal-title":"Naval Research Logistics Quarterly"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"1076","DOI":"10.1057\/palgrave.jors.2601612","volume":"54","author":"M. Haouari","year":"2003","unstructured":"Haouari, M., Ladhari, T.: A Branch-and-bound-based Local Search Method for the Flow Shop Problem. J. Oper. Res. Soc.\u00a054, 1076\u20131084 (2003)","journal-title":"J. Oper. Res. Soc."},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1023\/A:1018970020599","volume":"70","author":"G. Liu","year":"1997","unstructured":"Liu, G., Luh, P.B.: Scheduling Permutation Flow Shops Using the Lagrangian Relaxation Technique. Ann. Oper. Res.\u00a070, 171\u2013189 (1997)","journal-title":"Ann. Oper. Res."},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1016\/j.ejor.2005.02.001","volume":"169","author":"J.N.D. Gupta","year":"2006","unstructured":"Gupta, J.N.D., Stafford Jr., E.F.: Flowshop Scheduling Research after Five Decades. Eur. J. Oper. Res.\u00a0169, 699\u2013711 (2006)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"6_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, J., Ham, I.: A Heuristic Algorithm for the M-machine, N-job Flow-shop Sequencing Problem. Omega-Int. J. Manage. S.\u00a011(1), 91\u201395 (1983)","journal-title":"Omega-Int. J. Manage. S."},{"issue":"2","key":"6_CR6","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1016\/j.ejor.2004.04.017","volume":"165","author":"R. Ruiz","year":"2005","unstructured":"Ruiz, R.: A Comprehensive Review and Evaluation of Permutation Flowshop Heuristics. Eur. J. Oper. Res.\u00a0165(2), 479\u2013494 (2005)","journal-title":"Eur. J. Oper. Res."},{"key":"6_CR7","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. Eur. J. Oper. Res.\u00a047, 65\u201374 (1990)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"6_CR8","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/0377-2217(95)00037-2","volume":"91","author":"E. Nowicki","year":"1996","unstructured":"Nowicki, E., Smutnicki, C.: A Fast Tabu Search Algorithm for the Permutation Flow-Shop Problem. Eur. J. Oper. Res.\u00a091(1), 160\u2013175 (1996)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"6_CR9","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1080\/07408170600735553","volume":"39","author":"F. Jin","year":"2007","unstructured":"Jin, F., Song, S., Wu, C.: An Improved Version of the NEH Algorithm and Its Application to Large-scale Flow-shop Scheduling Problems. IIE. Trans.\u00a039(2), 229\u2013234 (2007)","journal-title":"IIE. Trans."},{"key":"6_CR10","doi-asserted-by":"publisher","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 Flowshops. Omega-Int. J. Manage. S.\u00a035, 53\u201360 (2007)","journal-title":"Omega-Int. J. Manage. S."},{"issue":"2","key":"6_CR11","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. Eur. J. Oper. Res.\u00a064(2), 278\u2013285 (1993)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25944-9_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T17:40:36Z","timestamp":1556041236000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25944-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642259432","9783642259449"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25944-9_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}