{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,18]],"date-time":"2025-10-18T21:03:52Z","timestamp":1760821432416,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,2,23]],"date-time":"2024-02-23T00:00:00Z","timestamp":1708646400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,2,23]],"date-time":"2024-02-23T00:00:00Z","timestamp":1708646400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62072476"],"award-info":[{"award-number":["62072476"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004735","name":"Natural Science Foundation of Hunan Province","doi-asserted-by":"publisher","award":["2020JJ4949","2021JJ40791"],"award-info":[{"award-number":["2020JJ4949","2021JJ40791"]}],"id":[{"id":"10.13039\/501100004735","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Excellent Youth Project of Science Research of Hunan Provincial Education Department","award":["19B604"],"award-info":[{"award-number":["19B604"]}]},{"name":"Open Project of Xiangjiang Laboratory","award":["22XJ03005"],"award-info":[{"award-number":["22XJ03005"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2024,3]]},"DOI":"10.1007\/s10878-024-01107-z","type":"journal-article","created":{"date-parts":[[2024,2,23]],"date-time":"2024-02-23T16:03:35Z","timestamp":1708704215000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On scheduling multiple parallel two-stage flowshops with Johnson\u2019s Rule"],"prefix":"10.1007","volume":"47","author":[{"given":"Guangwei","family":"Wu","sequence":"first","affiliation":[]},{"given":"Fu","family":"Zuo","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1415-0515","authenticated-orcid":false,"given":"Feng","family":"Shi","sequence":"additional","affiliation":[]},{"given":"Jianxin","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,23]]},"reference":[{"issue":"1\u20132","key":"1107_CR1","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/0377-2217(92)90264-A","volume":"61","author":"A Artiba","year":"1992","unstructured":"Artiba A, Tahon C (1992) Production planning knowledge-based system for pharmaceutical manufacturing lines. Eur J Oper Res 61(1\u20132):18\u201329","journal-title":"Eur J Oper Res"},{"key":"1107_CR2","volume-title":"Scheduling in computer and manufacturing systems","author":"J Blazewicz","year":"2012","unstructured":"Blazewicz J, Ecker KH, Schmidt G, Weglarz J (2012) Scheduling in computer and manufacturing systems. Springer, Berlin"},{"key":"1107_CR3","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.tcs.2022.04.004","volume":"921","author":"J Chen","year":"2022","unstructured":"Chen J, Huang M, Guo Y (2022) Scheduling multiple two-stage fowshops with a deadline. Theor Comput Sci 921:100\u2013111","journal-title":"Theor Comput Sci"},{"key":"1107_CR4","doi-asserted-by":"crossref","unstructured":"Dong J, Tong W, Luo T, Wang X, Hu J, Xu Y, Lin G (2017a) An FPTAS for the parallel two-stage flowshop problem. Theor Comput Sci 657:64\u201372","DOI":"10.1016\/j.tcs.2016.04.046"},{"key":"1107_CR5","doi-asserted-by":"crossref","unstructured":"Dong J, Hu J, Kovalyov M, Lin G, Luo T, Tong W, Wang X, Xu Y (2017b) Corrigendum to An FPTAS for the parallel two-stage flowshop problem. Theor Comput Sci 687:93\u201394","DOI":"10.1016\/j.tcs.2017.05.016"},{"issue":"1","key":"1107_CR6","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.ejor.2019.08.019","volume":"218","author":"J Dong","year":"2020","unstructured":"Dong J, Jin R, Luo T, Tong W (2020) A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops. Eur J Oper Res 218(1):16\u201324","journal-title":"Eur J Oper Res"},{"key":"1107_CR7","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman and Company, New York"},{"issue":"9","key":"1107_CR8","doi-asserted-by":"publisher","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"RL Graham","year":"1966","unstructured":"Graham RL (1966) Bounds for certain multiprocessing anomalies. Bell Labs Tech J 45(9):1563\u20131581","journal-title":"Bell Labs Tech J"},{"issue":"2","key":"1107_CR9","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"RL Graham","year":"1969","unstructured":"Graham RL (1969) Bounds on multiprocessing timing anomalies. SIAM J Appl Math 17(2):416\u2013429","journal-title":"SIAM J Appl Math"},{"key":"1107_CR10","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 AR (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5:287\u2013326","journal-title":"Ann Discrete Math"},{"issue":"2","key":"1107_CR11","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1080\/07408179608966258","volume":"28","author":"DW He","year":"1996","unstructured":"He DW, Kusiak A, Artiba A (1996) A scheduling problem in glass manufacturing. IIE Trans 28(2):129\u2013139","journal-title":"IIE Trans"},{"issue":"1","key":"1107_CR12","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1145\/7531.7535","volume":"34","author":"DS Hochbaum","year":"1987","unstructured":"Hochbaum DS, Shmoys DB (1987) Using dual approximation algorithms for scheduling problems: theoretical and practical results. J ACM 34(1):144\u2013162","journal-title":"J ACM"},{"issue":"1","key":"1107_CR13","doi-asserted-by":"publisher","first-page":"61","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. Naval Res Logist Q 1(1):61\u201368","journal-title":"Naval Res Logist Q"},{"key":"1107_CR14","first-page":"119","volume":"3","author":"MY Kovalyov","year":"1985","unstructured":"Kovalyov MY (1985) Efficient epsilon-approximation algorithm for minimizing the makespan in a parallel two-stage system. Vesti Academii navuk Belaruskai SSR Ser Phiz-Mat Navuk 3:119 (in Russian)","journal-title":"Vesti Academii navuk Belaruskai SSR Ser Phiz-Mat Navuk"},{"issue":"2","key":"1107_CR15","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1016\/j.ejor.2004.04.017","volume":"165","author":"R Ruiz","year":"2005","unstructured":"Ruiz R, Maroto C (2005) A comprehensive review and evaluation of permutation flowshop heuristics. Eur J Oper Res 165(2):479\u2013494","journal-title":"Eur J Oper Res"},{"key":"1107_CR16","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/S0304-3975(98)00157-1","volume":"237","author":"P Schuurman","year":"2000","unstructured":"Schuurman P, Woeginger GJ (2000) A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem. Theor Comput Sci 237:105\u2013122","journal-title":"Theor Comput Sci"},{"key":"1107_CR17","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1016\/j.tcs.2022.04.044","volume":"922","author":"W Tong","year":"2022","unstructured":"Tong W, Xu Y, Zhang H (2022) A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint. Theor Comput Sci 922:438\u2013446","journal-title":"Theor Comput Sci"},{"issue":"8","key":"1107_CR18","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1080\/07408170008967427","volume":"32","author":"G Vairaktarakis","year":"2000","unstructured":"Vairaktarakis G, Elhafsi M (2000) The use of flowlines to simplify routing complexity in two-stage flowshops. IIE Trans 32(8):687\u2013699","journal-title":"IIE Trans"},{"key":"1107_CR19","doi-asserted-by":"crossref","unstructured":"Wu G, Chen J, Wang J (2019a) Scheduling two-stage jobs on multiple flowshops. Theor Comput Sci 776:117\u2013124","DOI":"10.1016\/j.tcs.2019.01.017"},{"key":"1107_CR20","doi-asserted-by":"crossref","unstructured":"Wu G, Chen J, Wang J (2019b) On scheduling inclined jobs on multiple two-stage flowshops. Theor Comput Sci 786:67\u201377","DOI":"10.1016\/j.tcs.2018.04.005"},{"key":"1107_CR21","doi-asserted-by":"crossref","unstructured":"Wu G, Chen J, Wang J (2020a) On scheduling multiple two-stage flowshops. Theor Comput Sci 818:74\u201382","DOI":"10.1016\/j.tcs.2018.04.017"},{"key":"1107_CR22","doi-asserted-by":"crossref","unstructured":"Wu G, Chen J, Wang J (2020b) Improved approximation algorithms for two-stage flowshops scheduling problem. Theor Comput Sci 806:509\u2013515","DOI":"10.1016\/j.tcs.2019.08.028"},{"issue":"3","key":"1107_CR23","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1016\/j.ejor.2011.08.007","volume":"216","author":"X Zhang","year":"2012","unstructured":"Zhang X, van de Velde S (2012) Approximation algorithms for the parallel flow shop problem. Eur J Oper Res 216(3):544\u2013552","journal-title":"Eur J Oper Res"},{"issue":"1","key":"1107_CR24","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1504\/IJCC.2012.049763","volume":"4","author":"Y Zhang","year":"2012","unstructured":"Zhang Y, Zhou Y (2012) TransOS: a transparent computing-based operating system for the cloud. Int J Cloud Comput 4(1):287\u2013301","journal-title":"Int J Cloud Comput"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01107-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-024-01107-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01107-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T23:14:13Z","timestamp":1710285253000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-024-01107-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,23]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["1107"],"URL":"https:\/\/doi.org\/10.1007\/s10878-024-01107-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2024,2,23]]},"assertion":[{"value":"10 January 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 February 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"12"}}