{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T06:56:41Z","timestamp":1760425001362},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,7,27]],"date-time":"2010-07-27T00:00:00Z","timestamp":1280188800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2011,11]]},"DOI":"10.1007\/s10878-010-9330-x","type":"journal-article","created":{"date-parts":[[2010,7,26]],"date-time":"2010-07-26T21:16:57Z","timestamp":1280179017000},"page":"797-818","source":"Crossref","is-referenced-by-count":11,"title":["Minimizing makespan in an ordered flow shop with\u00a0machine-dependent processing times"],"prefix":"10.1007","volume":"22","author":[{"given":"Byung-Cheon","family":"Choi","sequence":"first","affiliation":[]},{"given":"Joseph Y.-T.","family":"Leung","sequence":"additional","affiliation":[]},{"given":"Michael L.","family":"Pinedo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,7,27]]},"reference":[{"key":"9330_CR1","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1145\/77600.77615","volume":"37","author":"RK Ahuja","year":"1996","unstructured":"Ahuja RK, Mehlhorn K, Orlin JB, Tarjan RE (1996) Faster algorithms for the shortest path problem. J\u00a0Assoc Comput Mach 37:213\u2013223","journal-title":"J\u00a0Assoc Comput Mach"},{"key":"9330_CR2","doi-asserted-by":"crossref","first-page":"909","DOI":"10.1016\/0305-0548(96)00012-3","volume":"23","author":"A Allahverdi","year":"1996","unstructured":"Allahverdi A (1996) Two-machine proportionate flowshop scheduling with breakdown to minimize maximum lateness. Comput Oper Res 23:909\u2013916","journal-title":"Comput Oper Res"},{"key":"9330_CR3","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/j.ejor.2007.05.040","volume":"188","author":"D Biskup","year":"2008","unstructured":"Biskup D (2008) A state-of-the-art review on scheduling with learning effects. Eur J Oper Res 188:315\u2013329","journal-title":"Eur J Oper Res"},{"key":"9330_CR4","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1111\/j.1937-5956.2000.tb00137.x","volume":"9","author":"TCE Cheng","year":"2000","unstructured":"Cheng TCE, Gupta JND, Wang G (2000) A review of flowshop-scheduling research with set-up times. Prod Oper Manag 9:262\u2013282","journal-title":"Prod Oper Manag"},{"key":"9330_CR5","doi-asserted-by":"crossref","first-page":"964","DOI":"10.1016\/j.ejor.2005.09.030","volume":"176","author":"BC Choi","year":"2007","unstructured":"Choi BC, Yoon SH, Chung SJ (2007) Minimizing maximum completion time in a proportionate flow shop with one machine of different speed. Eur J Oper Res 176:964\u2013974","journal-title":"Eur J Oper Res"},{"key":"9330_CR6","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey MR, Johnson DS, Sethi R (1976) The complexity of flowshop and jobshop scheduling. Math Oper Res 1:117\u2013129","journal-title":"Math Oper Res"},{"key":"9330_CR7","volume-title":"Time-dependent scheduling","author":"S Gawiejnowicz","year":"2008","unstructured":"Gawiejnowicz S (2008) Time-dependent scheduling. Springer, Berlin"},{"key":"9330_CR8","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/0020-0190(72)90045-2","volume":"1","author":"RL Graham","year":"1972","unstructured":"Graham RL (1972) An efficient algorithm for determining the convex hull of a finite planar set. Inf Process Lett 1:132\u2013133","journal-title":"Inf Process Lett"},{"key":"9330_CR9","doi-asserted-by":"crossref","first-page":"2895","DOI":"10.1080\/0020754050056417","volume":"43","author":"SR Hejazi","year":"2005","unstructured":"Hejazi SR, Saghafian S (2005) Flowshop-scheduling problems with makespan criterion: a review. Int J Prod Res 43:2895\u20132929","journal-title":"Int J Prod Res"},{"key":"9330_CR10","doi-asserted-by":"crossref","first-page":"887","DOI":"10.1287\/moor.24.4.887","volume":"24","author":"JA Hoogeveen","year":"1999","unstructured":"Hoogeveen JA, Kawaguchi T (1999) Minimizing total completion time in a two-machine flowshop: analysis of special cases. Math Oper Res 24:887\u2013910","journal-title":"Math Oper Res"},{"key":"9330_CR11","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/S0167-6377(02)00232-8","volume":"31","author":"S Hou","year":"2003","unstructured":"Hou S, Hoogeveen H (2003) The three-machine proportionate flow shop with unequal machine speeds. Oper Res Lett 31:225\u2013231","journal-title":"Oper Res Lett"},{"key":"9330_CR12","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1002\/nav.3800010110","volume":"1","author":"SM Johnson","year":"1954","unstructured":"Johnson SM (1954) Optimal two- and three-stage production schedules with setup times included. Nav Res Logist Q 1:62\u201367","journal-title":"Nav Res Logist Q"},{"key":"9330_CR13","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1016\/j.ejor.2008.01.031","volume":"193","author":"C Koulamas","year":"2009","unstructured":"Koulamas C, Kyparisis GJ (2009) A note on the proportional flow shop with a bottleneck machine. Eur J Oper Res 193:644\u2013645","journal-title":"Eur J Oper Res"},{"key":"9330_CR14","first-page":"851","volume":"31","author":"PS Ow","year":"1985","unstructured":"Ow PS (1985) Focused scheduling in proportionate flow shops. Manag Sci 31:851\u2013869","journal-title":"Manag Sci"},{"key":"9330_CR15","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1080\/00207547608956381","volume":"14","author":"SS Panwalkar","year":"1976","unstructured":"Panwalkar SS, Khan AW (1976) An ordered flow shop sequencing problem with mean completion time criterion. Int J Prod Res 14:631\u2013635","journal-title":"Int J Prod Res"},{"key":"9330_CR16","doi-asserted-by":"crossref","first-page":"1039","DOI":"10.1057\/jors.1980.191","volume":"31","author":"SS Panwalkar","year":"1980","unstructured":"Panwalkar SS, Woollam CR (1980) Ordered flow shop problems with no in-process waiting: future results. J Oper Res Soc 31:1039\u20131043","journal-title":"J Oper Res Soc"},{"key":"9330_CR17","volume-title":"Scheduling: theory, algorithms and systems","author":"M Pinedo","year":"2002","unstructured":"Pinedo M (2002) Scheduling: theory, algorithms and systems, 2nd edn. Prentice-Hall, New York","edition":"2"},{"key":"9330_CR18","doi-asserted-by":"crossref","first-page":"1643","DOI":"10.1016\/j.dam.2007.02.003","volume":"155","author":"D Shabtay","year":"2007","unstructured":"Shabtay D, Steiner G (2007) A survey of scheduling with controllable processing times. Discrete Appl Math 155:1643\u20131666","journal-title":"Discrete Appl Math"},{"key":"9330_CR19","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1002\/(SICI)1099-1425(1998100)1:3<157::AID-JOS12>3.0.CO;2-Y","volume":"1","author":"N Shakhlevich","year":"1998","unstructured":"Shakhlevich N, Hoogeveen H, Pinedo M (1998) Minimizing total weighted completion time in a proportionate flow shop. J Sched 1:157\u2013168","journal-title":"J Sched"},{"key":"9330_CR20","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1287\/mnsc.21.5.544","volume":"21","author":"ML Smith","year":"1975","unstructured":"Smith ML, Panwalkar SS, Dudek RA (1975) Flow shop sequencing problem with ordered processing time matrices. Manag Sci 21:544\u2013549","journal-title":"Manag Sci"},{"key":"9330_CR21","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1002\/nav.3800230310","volume":"23","author":"ML Smith","year":"1976","unstructured":"Smith ML, Panwalkar SS, Dudek RA (1976) Flow shop sequencing problem with ordered processing time matrices: a general case. Nav Res Logist Q 23:481\u2013486","journal-title":"Nav Res Logist Q"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9330-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/link.springer.com\/article\/10.1007\/s10878-010-9330-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9330-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:14Z","timestamp":1559276594000},"score":1,"resource":{"primary":{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/link.springer.com\/10.1007\/s10878-010-9330-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7,27]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,11]]}},"alternative-id":["9330"],"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1007\/s10878-010-9330-x","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,7,27]]}}}