{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:09Z","timestamp":1759639089468,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030931759"},{"type":"electronic","value":"9783030931766"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-93176-6_8","type":"book-chapter","created":{"date-parts":[[2021,12,16]],"date-time":"2021-12-16T22:09:57Z","timestamp":1639692597000},"page":"83-95","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Scheduling on\u00a0Multiple Two-Stage Flowshops with\u00a0a\u00a0Deadline"],"prefix":"10.1007","author":[{"given":"Jianer","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minjie","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yin","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,17]]},"reference":[{"issue":"3","key":"8_CR1","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1137\/S0097539700382820","volume":"35","author":"C Chekuri","year":"2005","unstructured":"Chekuri, C., Khanna, S.: A polynomial time approximation scheme for the multiple knapsack problem. SIAM J. Comput. 35(3), 713\u2013728 (2005)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"8_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3233524","volume":"14","author":"L Chen","year":"2018","unstructured":"Chen, L., Zhang, G.: Packing groups of items into multiple knapsacks. ACM Trans. Algorithms 14(4), 1\u201324 (2018)","journal-title":"ACM Trans. Algorithms"},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.mcm.2004.12.016","volume":"44","author":"M Dawande","year":"2006","unstructured":"Dawande, M., Gavirneni, S., Rachamadugu, R.: Scheduling a two-stage flowshop under makespan constraint. Math. Comput. Model. 44, 73\u201384 (2006)","journal-title":"Math. Comput. Model."},{"key":"8_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":"8_CR5","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.ejor.2019.08.019","volume":"281","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. 281, 16\u201324 (2020)","journal-title":"Eur. J. Oper. Res."},{"key":"8_CR6","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":"4","key":"8_CR7","doi-asserted-by":"publisher","first-page":"1392","DOI":"10.1137\/080731207","volume":"39","author":"K Jansen","year":"2010","unstructured":"Jansen, K.: Parameterized approximation scheme for the multiple knapsack problem. SIAM J. Comput. 39(4), 1392\u20131412 (2010)","journal-title":"SIAM J. Comput."},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-642-27660-6_26","volume-title":"SOFSEM 2012: Theory and Practice of Computer Science","author":"K Jansen","year":"2012","unstructured":"Jansen, K.: A fast approximation scheme for the multiple knapsack problem. In: Bielikov\u00e1, M., Friedrich, G., Gottlob, G., Katzenbeisser, S., Tur\u00e1n, G. (eds.) SOFSEM 2012. LNCS, vol. 7147, pp. 313\u2013324. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-27660-6_26"},{"issue":"1","key":"8_CR9","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. Naval Res. Logist. Q. 1(1), 61\u201368 (1954)","journal-title":"Naval Res. Logist. Q."},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-540-48413-4_6","volume-title":"Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques","author":"H Kellerer","year":"1999","unstructured":"Kellerer, H.: A polynomial time approximation scheme for the multiple knapsack problem. In: Hochbaum, D.S., Jansen, K., Rolim, J.D.P., Sinclair, A. (eds.) APPROX\/RANDOM -1999. LNCS, vol. 1671, pp. 51\u201362. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-540-48413-4_6"},{"key":"8_CR11","first-page":"119","volume":"3","author":"MY Kovalyov","year":"1985","unstructured":"Kovalyov, M.Y.: Efficient epsilon-approximation algorithm for minimizing the makespan in a parallel two-stage system. Vesti Acad. navuk Belaruskai SSR Ser. Phiz.-Mat. Navuk 3, 119 (1985). (in Russian)","journal-title":"Vesti Acad. navuk Belaruskai SSR Ser. Phiz.-Mat. Navuk"},{"key":"8_CR12","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":"8_CR13","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":"8_CR14","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1016\/j.tcs.2019.08.028","volume":"806","author":"G Wu","year":"2020","unstructured":"Wu, G., Chen, J., Wang, J.: Improved approximation algorithms for two-stage flowshops scheduling problem. Theor. Comput. Sci. 806, 509\u2013515 (2020)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR15","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":"8_CR16","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":"8_CR17","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 Comut. 4(1), 287\u2013301 (2012)","journal-title":"Int. J. Cloud Comut."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-93176-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T05:44:23Z","timestamp":1641015863000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-93176-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030931759","9783030931766"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-93176-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"17 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Applications in Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aaim2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/AAIM2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"62","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":"38","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":"61% - 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":"3","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}