{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T13:06:05Z","timestamp":1771333565855,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,9,23]],"date-time":"2019-09-23T00:00:00Z","timestamp":1569196800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,9,23]],"date-time":"2019-09-23T00:00:00Z","timestamp":1569196800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2020,1]]},"DOI":"10.1007\/s10878-019-00449-3","type":"journal-article","created":{"date-parts":[[2019,9,23]],"date-time":"2019-09-23T14:02:38Z","timestamp":1569247358000},"page":"1-14","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Approximation algorithms for two-stage flexible flow shop scheduling"],"prefix":"10.1007","volume":"39","author":[{"given":"Minghui","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Yan","family":"Lan","sequence":"additional","affiliation":[]},{"given":"Xin","family":"Han","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,9,23]]},"reference":[{"key":"449_CR1","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1007\/s00170-002-1498-5","volume":"22","author":"D Alisantoso","year":"2003","unstructured":"Alisantoso D, Khoo KP, Jiang PY (2003) An immune algorithm approach to the scheduling of a flexible PCB flow shop. Int J Adv Manuf Technol 22:819\u2013827","journal-title":"Int J Adv Manuf Technol"},{"issue":"1","key":"449_CR2","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.ijpe.2012.09.014","volume":"145","author":"C Almeder","year":"2013","unstructured":"Almeder C, Hartl RF (2013) A meta heuristic optimization approach for a real-world stochastic flexible flow shop problem with limited buffer. Int J Prod Econ 145(1):88\u201395","journal-title":"Int J Prod Econ"},{"issue":"1","key":"449_CR3","first-page":"10","volume":"8","author":"TS Arthanari","year":"1971","unstructured":"Arthanari TS, Ramamurthy KG (1971) An extension of two machines sequencing problem. Opsearch 8(1):10\u201322","journal-title":"Opsearch"},{"issue":"1","key":"449_CR4","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s10878-011-9423-1","volume":"25","author":"BC Choi","year":"2013","unstructured":"Choi BC, Lee K (2013) Two-stage proportionate flexible flow shop to minimize the makespane. J Comb Optim 25(1):123\u2013134","journal-title":"J Comb Optim"},{"issue":"2","key":"449_CR5","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0377-2217(96)00123-3","volume":"94","author":"M Drozdowski","year":"1996","unstructured":"Drozdowski M (1996) Scheduling multiprocessor tasks\u2014an overview. Eur J Oper Res 94(2):215\u2013230","journal-title":"Eur J Oper Res"},{"issue":"10","key":"449_CR6","doi-asserted-by":"publisher","first-page":"1417","DOI":"10.1016\/S0305-0548(01)00040-5","volume":"29","author":"JND Gupta","year":"2002","unstructured":"Gupta JND, Lauff V, Werner F (2002) Heuristics for hybrid flow shops with controllable processing times and assignable due dates. Comput Oper Res 29(10):1417\u20131439","journal-title":"Comput Oper Res"},{"issue":"2","key":"449_CR7","first-page":"829","volume":"25","author":"LM He","year":"2008","unstructured":"He LM, Sun SJ, Luo RZ (2008) Two-stage flexible flow shop scheduling problems with a batch process on second stage. Chin J Eng Math 25(2):829\u2013842","journal-title":"Chin J Eng Math"},{"issue":"3","key":"449_CR8","doi-asserted-by":"publisher","first-page":"3571","DOI":"10.1137\/080736491","volume":"39","author":"K Jansen","year":"2010","unstructured":"Jansen K, Thole R (2010) Approximation algorithms for scheduling parallel jobs. SIAM J Comput 39(3):3571\u20133615","journal-title":"SIAM J Comput"},{"issue":"1","key":"449_CR9","first-page":"61","volume":"1","author":"SM Johnson","year":"1954","unstructured":"Johnson SM (1954) Optimal two- and three-stage production schedules with setup times included. Eur J Oper 1(1):61\u201368","journal-title":"Eur J Oper"},{"issue":"3","key":"449_CR10","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0167-6377(94)90026-4","volume":"16","author":"CY Lee","year":"1994","unstructured":"Lee CY, Vairaktarakis GL (1994) Minimizing makespan in hybrid flowshop. Oper Res Lett 16(3):149\u2013158","journal-title":"Oper Res Lett"},{"issue":"2","key":"449_CR11","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0925-5273(03)00011-2","volume":"86","author":"HT Lin","year":"2003","unstructured":"Lin HT, Liao CJ (2003) A case study in a two-stage hybrid flow shop with setup time and dedicated machines. Int J Prod Econ 86(2):133\u2013143","journal-title":"Int J Prod Econ"},{"issue":"1","key":"449_CR12","first-page":"289","volume":"8","author":"B Moseley","year":"2011","unstructured":"Moseley B, Kumar R (2011) On scheduling in map-reduce and flow-shops. ACM Symp Parallelism Algorithms Archit 8(1):289\u2013298","journal-title":"ACM Symp Parallelism Algorithms Archit"},{"key":"449_CR13","first-page":"83","volume-title":"Lecture Notes in Economics and Mathematical Systems","author":"Michael S. Salvador","year":"1973","unstructured":"Salvador MS (1973) A solution to a special class of flow shop scheduling problems. In: Symposium of theory of scheduling and its applications, pp 83\u201391"},{"key":"449_CR14","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1137\/S0097539793255801","volume":"26","author":"A Steinberg","year":"1997","unstructured":"Steinberg A (1997) A strip-packing algorithm with absolute performance bound 2. SIAM J Comput 26:401\u2013409","journal-title":"SIAM J Comput"},{"issue":"2","key":"449_CR15","first-page":"298","volume":"25","author":"JH Sun","year":"2014","unstructured":"Sun JH, Deng QX, Meng YK (2014) Two-stage workload scheduling problem on GPU architectures formulation and approximation algorithm. J Softw 25(2):298\u2013313","journal-title":"J Softw"},{"issue":"3","key":"449_CR16","first-page":"295","volume":"20","author":"W Wang","year":"2003","unstructured":"Wang W, Hunsucker JL (2003) An evaluation of the CDS heuristicin flow shops with multiple processors. J Chin Inst Ind Eng 20(3):295\u2013304","journal-title":"J Chin Inst Ind Eng"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-019-00449-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-019-00449-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-019-00449-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,21]],"date-time":"2020-09-21T23:18:09Z","timestamp":1600730289000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-019-00449-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,23]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,1]]}},"alternative-id":["449"],"URL":"https:\/\/doi.org\/10.1007\/s10878-019-00449-3","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,9,23]]},"assertion":[{"value":"23 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}