{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:12:24Z","timestamp":1743095544722,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031393433"},{"type":"electronic","value":"9783031393440"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-39344-0_16","type":"book-chapter","created":{"date-parts":[[2023,8,25]],"date-time":"2023-08-25T20:27:10Z","timestamp":1692995230000},"page":"212-224","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Applying Johnson\u2019s Rule in\u00a0Scheduling Multiple Parallel Two-Stage Flowshops"],"prefix":"10.1007","author":[{"given":"Guangwei","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fu","family":"Zuo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feng","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianxin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,26]]},"reference":[{"issue":"1\u20132","key":"16_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.: Production planning knowledge-based system for pharmaceutical manufacturing lines. Eur. J. Oper. Res. 61(1\u20132), 18\u201329 (1992)","journal-title":"Eur. J. Oper. Res."},{"key":"16_CR2","volume-title":"Scheduling in Computer and Manufacturing Systems","author":"J Blazewicz","year":"2012","unstructured":"Blazewicz, J., Ecker, K.H., Schmidt, G., Weglarz, J.: Scheduling in Computer and Manufacturing Systems. Springer, Berlin (2012)"},{"key":"16_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.: Scheduling multiple two-stage flowshops with a deadline. Theor. Comput. Sci. 921, 100\u2013111 (2022)","journal-title":"Theor. Comput. Sci."},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.tcs.2016.04.046","volume":"657","author":"J Dong","year":"2017","unstructured":"Dong, J., et al.: An FPTAS for the parallel two-stage flowshop problem. Theor. Comput. Sci. 657, 64\u201372 (2017)","journal-title":"Theor. Comput. Sci."},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.tcs.2017.05.016","volume":"687","author":"J Dong","year":"2017","unstructured":"Dong, J., et al.: Corrigendum to \u201cAn FPTAS for the parallel two-stage flowshop problem\u2019\u2019. Theor. Comput. Sci. 687, 93\u201394 (2017)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"16_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.: A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops. Eur. J. Oper. Res. 218(1), 16\u201324 (2020)","journal-title":"Eur. J. Oper. Res."},{"key":"16_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. W.H. Freeman and Company, New York (1979)"},{"issue":"9","key":"16_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, R.L.: Bounds for certain multiprocessing anomalies. Bell Labs Tech. J. 45(9), 1563\u20131581 (1966)","journal-title":"Bell Labs Tech. J."},{"issue":"2","key":"16_CR9","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"RL Graham","year":"1969","unstructured":"Graham, R.L.: Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math. 17(2), 416\u2013429 (1969)","journal-title":"SIAM J. Appl. Math."},{"key":"16_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, R.L., Lawler, E.L., Lenstra, J.K., Kan, A.R.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discret. Math. 5, 287\u2013326 (1979)","journal-title":"Ann. Discret. Math."},{"issue":"2","key":"16_CR11","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1080\/07408179608966258","volume":"28","author":"DW He","year":"1996","unstructured":"He, D.W., Kusiak, A., Artiba, A.: A scheduling problem in glass manufacturing. IIE Trans. 28(2), 129\u2013139 (1996)","journal-title":"IIE Trans."},{"issue":"1","key":"16_CR12","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1145\/7531.7535","volume":"34","author":"DS Hochbaum","year":"1987","unstructured":"Hochbaum, D.S., Shmoys, D.B.: Using dual approximation algorithms for scheduling problems: theoretical and practical results. J. ACM 34(1), 144\u2013162 (1987)","journal-title":"J. ACM"},{"issue":"1","key":"16_CR13","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"SM Johnson","year":"1954","unstructured":"Johnson, S.M.: Optimal two- and three-stage production schedules with setup times included. Nav. Res. Logist. Q. 1(1), 61\u201368 (1954)","journal-title":"Nav. Res. Logist. Q."},{"key":"16_CR14","unstructured":"Kovalyov, M.Y.: 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 (1985). (in Russian)"},{"issue":"2","key":"16_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.: A comprehensive review and evaluation of permutation flowshop heuristics. Eur. J. Oper. Res. 165(2), 479\u2013494 (2005)","journal-title":"Eur. J. Oper. Res."},{"key":"16_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, G.J.: A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem. Theor. Comput. Sci. 237, 105\u2013122 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"16_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.: A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint. Theor. Comput. Sci. 922, 438\u2013446 (2022)","journal-title":"Theor. Comput. Sci."},{"issue":"8","key":"16_CR18","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1080\/07408170008967427","volume":"32","author":"G Vairaktarakis","year":"2000","unstructured":"Vairaktarakis, G., Elhafsi, M.: The use of flowlines to simplify routing complexity in two-stage flowshops. IIE Trans. 32(8), 687\u2013699 (2000)","journal-title":"IIE Trans."},{"key":"16_CR19","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.tcs.2019.01.017","volume":"776","author":"G Wu","year":"2019","unstructured":"Wu, G., Chen, J., Wang, J.: Scheduling two-stage jobs on multiple flowshops. Theor. Comput. Sci. 776, 117\u2013124 (2019)","journal-title":"Theor. Comput. Sci."},{"key":"16_CR20","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.tcs.2018.04.005","volume":"786","author":"G Wu","year":"2019","unstructured":"Wu, G., Chen, J., Wang, J.: On scheduling inclined jobs on multiple two-stage flowshops. Theor. Comput. Sci. 786, 67\u201377 (2019)","journal-title":"Theor. Comput. Sci."},{"key":"16_CR21","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.tcs.2018.04.017","volume":"818","author":"G Wu","year":"2020","unstructured":"Wu, G., Chen, J., Wang, J.: On scheduling multiple two-stage flowshops. Theor. Comput. Sci. 818, 74\u201382 (2020)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"16_CR22","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.: Approximation algorithms for the parallel flow shop problem. Eur. J. Oper. Res. 216(3), 544\u2013552 (2012)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"16_CR23","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.: TransOS: a transparent computing-based operating system for the cloud. Int. J. Cloud Comput. 4(1), 287\u2013301 (2012)","journal-title":"Int. J. Cloud Comput."}],"container-title":["Lecture Notes in Computer Science","Frontiers of Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-39344-0_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,25]],"date-time":"2023-08-25T20:28:29Z","timestamp":1692995309000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-39344-0_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031393433","9783031393440"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-39344-0_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"26 August 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IJTCS-FAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Frontiers in Algorithmics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Macau","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"faw2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conferences.cis.um.edu.mo\/ijtcs2023\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"34","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"62% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}