{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:22:50Z","timestamp":1725567770468},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642163579"},{"type":"electronic","value":"9783642163586"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16358-6_5","type":"book-chapter","created":{"date-parts":[[2010,10,19]],"date-time":"2010-10-19T10:36:18Z","timestamp":1287484578000},"page":"33-40","source":"Crossref","is-referenced-by-count":3,"title":["Improvement Tools for NEH Based Heuristics on Permutation and Blocking Flow Shop Scheduling Problems"],"prefix":"10.1007","author":[{"given":"Imma","family":"Ribas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manel","family":"Mateo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: A survey. In: Annals of Discrete Mathematics, pp. 5287\u20135326 (1979)","DOI":"10.1016\/S0167-5060(08)70356-X"},{"key":"5_CR2","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 set up times included. Naval Research Logistics Quarterly\u00a01, 61\u201368 (1954)","journal-title":"Naval Research Logistics Quarterly"},{"key":"5_CR3","volume-title":"Computers and intractability: A guide to the theory of NP-Completness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability: A guide to the theory of NP-Completness. Freeman, San Francisco (1979)"},{"key":"5_CR4","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 Jr., E.E., Ham, I.: A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega\u00a011, 91\u201395 (1983)","journal-title":"Omega"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"1374","DOI":"10.1057\/palgrave.jors.2601466","volume":"53","author":"M.S. Nagano","year":"2002","unstructured":"Nagano, M.S., Moccellin, J.V.: A high quality constructive heuristic for flow shop sequencing. Journal of the Operational Research Society\u00a053, 1374\u20131379 (2002)","journal-title":"Journal of the Operational Research Society"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1080\/00207540210161650","volume":"41","author":"J.M. Framinan","year":"2003","unstructured":"Framinan, J.M., Leisten, R., Ramamoorthy, B.: 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\u00a041, 121\u2013148 (2003)","journal-title":"International Journal of Production Research"},{"key":"5_CR7","first-page":"7","volume":"5","author":"R. Companys","year":"1966","unstructured":"Companys, R.: M\u00e9todos heur\u00edsticos en la resoluci\u00f3n del problema del taller mec\u00e1nico. Estudios Empresariales\u00a05, 7\u201318 (1966)","journal-title":"Estudios Empresariales"},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"648","DOI":"10.1080\/09537280152582995","volume":"12","author":"H.D. Pour","year":"2001","unstructured":"Pour, H.D.: A new heuristic for the n-job, m-machine flow shop problem. Production Planning & Control\u00a012, 648\u2013653 (2001)","journal-title":"Production Planning & Control"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1057\/jors.1972.52","volume":"23","author":"S.S. Reddi","year":"1972","unstructured":"Reddi, S.S., Ramamoorthy, B.: On the flow-shop sequencing problem with no wait in process. Opers Res. Q.\u00a023, 323\u2013331 (1972)","journal-title":"Opers Res. Q."},{"key":"5_CR10","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, 510\u2013525 (1996)","journal-title":"Operations Research"},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1145\/322203.322213","volume":"27","author":"C.H. Papadimitriou","year":"1980","unstructured":"Papadimitriou, C.H., Kanellakis, P.C.: Flowshop scheduling with limited temporary storage. Journal of the ACM\u00a027, 533\u2013549 (1980)","journal-title":"Journal of the ACM"},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"2085","DOI":"10.1080\/00207549008942855","volume":"28","author":"R. Leisten","year":"1990","unstructured":"Leisten, R.: Flowshop sequencing problems with limited buffer storage. Int. J. Prod. Res.\u00a028, 2085\u20132100 (1990)","journal-title":"Int. J. Prod. Res."},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1287\/opre.37.6.925","volume":"37","author":"S.T. McCormick","year":"1989","unstructured":"McCormick, S.T., Pinedo, M.L., Shenker, S., Wolf, B.: Sequencing in an Assembly Line with Blocking to Minimize Cycle Time. Operations Research\u00a037, 925\u2013936 (1989)","journal-title":"Operations Research"},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"3001","DOI":"10.1016\/j.cor.2007.01.020","volume":"9","author":"P.J. Kalczynski","year":"2008","unstructured":"Kalczynski, P.J., Kamburowski, J.: An improved NEH heuristic to minimize makespan in permutation flow shops. Computers & Operations Research\u00a09, 3001\u20133008 (2008)","journal-title":"Computers & Operations Research"},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"938","DOI":"10.1016\/j.cor.2005.05.018","volume":"34","author":"R. Companys","year":"2007","unstructured":"Companys, R., Mateo, M.: Different behaviour of a double branch-and-bound algorithm on Fm|prmu|Cmax and Fm|block|Cmax problems. Computers & Operations Research\u00a034, 938\u2013953 (2007)","journal-title":"Computers & Operations Research"},{"key":"5_CR16","unstructured":"Companys, R.: Note on the blocking flowshop problem. Working paper (2009), \n                      \n                        http:\/\/upcommons.upc.edu\/e-prints\/handle\/2117\/420"}],"container-title":["IFIP Advances in Information and Communication Technology","Advances in Production Management Systems. New Challenges, New Approaches"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16358-6_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:26:52Z","timestamp":1619785612000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16358-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642163579","9783642163586"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16358-6_5","relation":{},"ISSN":["1868-4238","1861-2288"],"issn-type":[{"type":"print","value":"1868-4238"},{"type":"electronic","value":"1861-2288"}],"subject":[],"published":{"date-parts":[[2010]]}}}