{"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":1771333565877,"version":"3.50.1"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,10,23]],"date-time":"2020-10-23T00:00:00Z","timestamp":1603411200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,10,23]],"date-time":"2020-10-23T00:00:00Z","timestamp":1603411200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["20720190068"],"award-info":[{"award-number":["20720190068"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2021,1]]},"DOI":"10.1007\/s10878-020-00657-2","type":"journal-article","created":{"date-parts":[[2020,10,23]],"date-time":"2020-10-23T10:02:54Z","timestamp":1603447374000},"page":"28-42","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Improved approximation algorithms for two-stage flexible flow shop scheduling"],"prefix":"10.1007","volume":"41","author":[{"given":"Anzhen","family":"Peng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Longcheng","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weifeng","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,10,23]]},"reference":[{"key":"657_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 LP, 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"},{"key":"657_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 metaheuristic optimization approach for a real-world stochastic flexible flow shop problem with limited buffer. Int J Prod Econ 145:88\u201395","journal-title":"Int J Prod Econ"},{"key":"657_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:10\u201322","journal-title":"Opsearch"},{"key":"657_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 makespan. J Comb Optim 25:123\u2013134","journal-title":"J Comb Optim"},{"key":"657_CR5","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham RL, Lawler EL, Lenstra JK, Kan R (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5:287\u2013326","journal-title":"Ann Discrete Math"},{"key":"657_CR6","doi-asserted-by":"publisher","first-page":"1417","DOI":"10.1016\/S0305-0548(01)00040-5","volume":"29","author":"J Gupta","year":"2002","unstructured":"Gupta J, Kr\u00fcger K, Lauff V, Werner F, Sotskov Y (2002) Heuristics for hybrid flow shops with controllable processing times and assignable due dates. Comput Oper Res 29:1417\u20131439","journal-title":"Comput Oper Res"},{"key":"657_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 processor on second stage. Chin J Eng Math 25:829\u2013842","journal-title":"Chin J Eng Math"},{"key":"657_CR8","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 flowshops. Oper Res Lett 16:149\u2013158","journal-title":"Oper Res Lett"},{"key":"657_CR9","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:133\u2013143","journal-title":"Int J Prod Econ"},{"key":"657_CR10","doi-asserted-by":"crossref","unstructured":"Moseley B, Dasgupta A, Kumar R, Sarl\u00f3s T (2011) On scheduling in map-reduce and flow-shops. In: Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures(SPAA \u201911), pp 289\u2013298","DOI":"10.1145\/1989493.1989540"},{"key":"657_CR11","doi-asserted-by":"crossref","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","DOI":"10.1007\/978-3-642-80784-8_7"},{"key":"657_CR12","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:298\u2013313","journal-title":"J Softw"},{"key":"657_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10878-019-00449-3","volume":"39","author":"MH Zhang","year":"2020","unstructured":"Zhang MH, Lan Y, Han X (2020) Approximation algorithms for two-stage flexible flow shop scheduling. J Comb Optim 39:1\u201314","journal-title":"J Comb Optim"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00657-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-020-00657-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00657-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,22]],"date-time":"2021-10-22T19:14:04Z","timestamp":1634930044000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-020-00657-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,23]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["657"],"URL":"https:\/\/doi.org\/10.1007\/s10878-020-00657-2","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,10,23]]},"assertion":[{"value":"29 September 2020","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 October 2020","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}