{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:54:30Z","timestamp":1742939670825,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642200083"},{"type":"electronic","value":"9783642200090"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20009-0_77","type":"book-chapter","created":{"date-parts":[[2011,6,25]],"date-time":"2011-06-25T18:32:23Z","timestamp":1309026743000},"page":"485-490","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Hybrid Flow Shop Scheduling: Heuristic Solutions and LP-Based Lower Bounds"],"prefix":"10.1007","author":[{"given":"Verena","family":"Gondek","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,6,21]]},"reference":[{"issue":"3","key":"77_CR1_77","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1016\/S0377-2217(00)00142-9","volume":"132","author":"M. Azizo\u011flu","year":"2001","unstructured":"M. Azizo\u011flu, E. \u00e7akmak, and S. Kondakci. A flexible flowshop problem with total flow time minimization. Eur. J. Oper. Res., 132(3): 528\u2013538, 2001.","journal-title":"Eur. J. Oper. Res."},{"key":"77_CR2_77","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1016\/j.ejor.2009.06.035","volume":"202","author":"J. Carlier","year":"2010","unstructured":"J. Carlier, M. Haouari, M. Kharbeche, and A. Moukrim. An optimization-based heuristic for the robotic cell problem. Eur. J. Oper. Res., 202: 636\u2013645, 2010.","journal-title":"Eur. J. Oper. Res."},{"key":"77_CR3_77","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0166-218X(90)90104-K","volume":"26","author":"M.E. Dyer","year":"1990","unstructured":"M.E. Dyer and L.A. Wolsey. Formulating the single machine sequencing problem with release dates as a mixed integer program. Discrete Appl. Math., 26: 255\u2013270, 1990.","journal-title":"Discrete Appl. Math."},{"key":"77_CR4_77","doi-asserted-by":"crossref","unstructured":"M.X. Goemans. A supermodular relaxation for scheduling with release dates. In Queyranne (Eds.), Integer Programming and Combinatorial Optimization, Lect. Notes Comput. Sci., pages 288\u2013300. Springer, 1996.","DOI":"10.1007\/3-540-61310-2_22"},{"key":"77_CR5_77","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/S0167-6377(01)00104-3","volume":"29","author":"J. Hurink","year":"2001","unstructured":"J. Hurink and S. Knust. List scheduling in a parallel machine environment with precedence constraints and setup times. Oper. Res. Lett., 29: 231\u2013239, 2001.","journal-title":"Oper. Res. Lett."},{"key":"77_CR6_77","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/S0167-6377(01)00072-4","volume":"29","author":"G.J. Kyparisis","year":"2001","unstructured":"G.J. Kyparisis and C. Koulamas. A note on weighted completion time minimization in a flexible flow shop. Oper. Res. Lett., 29: 5\u201311, 2001.","journal-title":"Oper. Res. Lett."},{"issue":"5","key":"77_CR7_77","doi-asserted-by":"publisher","first-page":"1241","DOI":"10.1137\/S0097539799358094","volume":"35","author":"M. Queyranne","year":"2006","unstructured":"M. Queyranne and A.S. Schulz. Approximation bounds for a general class of precedence constrained parallel machine scheduling problems. SIAM J. Comp., 35(5): 1241\u20131253, 2006.","journal-title":"SIAM J. Comp."},{"key":"77_CR8_77","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/3-540-61310-2_23","volume":"1084","author":"A.S. Schulz","year":"1996","unstructured":"A.S. Schulz. Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds. Lect. Notes Comput. Sci., 1084: 301\u2013315, 1996.","journal-title":"Lect. Notes Comput. Sci."},{"key":"77_CR9_77","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0925-5273(00)00066-9","volume":"70","author":"M.X. Weng","year":"2001","unstructured":"M.X. Weng, J. Lu, and H. Ren. Unrelated parallel machine scheduling with setup consideration and a total weighted completion time objective. Int. J. Prod. Eco., 70: 215\u2013226, 2001.","journal-title":"Int. J. Prod. Eco."}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2010"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20009-0_77","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T16:38:23Z","timestamp":1675269503000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-20009-0_77"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642200083","9783642200090"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20009-0_77","relation":{},"ISSN":["0721-5924"],"issn-type":[{"type":"print","value":"0721-5924"}],"subject":[],"published":{"date-parts":[[2011]]},"assertion":[{"value":"21 June 2011","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}