{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T00:26:09Z","timestamp":1743121569715,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031221040"},{"type":"electronic","value":"9783031221057"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-22105-7_2","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:12:32Z","timestamp":1672549952000},"page":"12-23","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Flow Shop Scheduling Problems with\u00a0Transportation Constraints Revisited"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5403-6576","authenticated-orcid":false,"given":"Yuan","family":"Yuan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1694-7712","authenticated-orcid":false,"given":"Xin","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3311-1105","authenticated-orcid":false,"given":"Yan","family":"Lan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"issue":"3","key":"2_CR1","doi-asserted-by":"publisher","first-page":"1316","DOI":"10.1007\/s10878-014-9825-y","volume":"31","author":"J Dong","year":"2016","unstructured":"Dong, J., Wang, X., Hu, J., Lin, G.: An improved two-machine flowshop scheduling with intermediate transportation. J. Comb. Optim. 31(3), 1316\u20131334 (2016)","journal-title":"J. Comb. Optim."},{"unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman (1979)","key":"2_CR2"},{"issue":"9","key":"2_CR3","doi-asserted-by":"publisher","first-page":"1267","DOI":"10.1016\/j.cor.2010.10.018","volume":"38","author":"H Gong","year":"2011","unstructured":"Gong, H., Tang, L.: Two-machine flowshop scheduling with intermediate transportation under job physical space consideration. Comput. Oper. Res. 38(9), 1267\u20131274 (2011)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"2_CR4","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/BF01585870","volume":"82","author":"LA Hall","year":"1998","unstructured":"Hall, L.A.: Approximability of flow shop scheduling. Math. Program. 82(1), 175\u2013190 (1998)","journal-title":"Math. Program."},{"issue":"1","key":"2_CR5","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1287\/moor.17.1.22","volume":"17","author":"LA Hall","year":"1992","unstructured":"Hall, L.A., Shmoys, D.B.: Jackson\u2019s rule for single-machine scheduling: making a good heuristic better. Math. Oper. Res. 17(1), 22\u201335 (1992)","journal-title":"Math. Oper. Res."},{"issue":"1\u20133","key":"2_CR6","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S0166-218X(00)00316-4","volume":"112","author":"J Hurink","year":"2001","unstructured":"Hurink, J., Knust, S.: Makespan minimization for flow-shop problems with transportation times and a single robot. Discret. Appl. Math. 112(1\u20133), 199\u2013216 (2001)","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"2_CR7","first-page":"354","volume":"34","author":"H Kise","year":"1991","unstructured":"Kise, H.: On an automated two-machine flowshop scheduling problem with infinite buffer. J. Oper. Res. Soc. Jpn. 34(3), 354\u2013361 (1991)","journal-title":"J. Oper. Res. Soc. Jpn."},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.tcs.2017.01.018","volume":"670","author":"Y Lan","year":"2017","unstructured":"Lan, Y., Han, X., Wang, Y., Ge, M., Guo, H., Chen, X.: Flowshop problem F2$$\\rightarrow $$D$$\\vert $$v= 1$$, c\\ge 1$$$$\\vert $$Cmax revisited. Theoret. Comput. Sci. 670, 79\u201385 (2017)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"2_CR9","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.ipl.2015.09.003","volume":"116","author":"Y Lan","year":"2016","unstructured":"Lan, Y., Han, X., Wu, Z., Guo, H., Chen, X.: Complexity of problem TF2$$\\vert $$v= 1, c= 2$$\\vert $$Cmax. Inf. Process. Lett. 116(1), 65\u201369 (2016)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"2_CR10","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1002\/1099-1425(200101\/02)4:1<3::AID-JOS57>3.0.CO;2-D","volume":"4","author":"CY Lee","year":"2001","unstructured":"Lee, C.Y., Chen, Z.L.: Machine scheduling with transportation considerations. J. Sched. 4(1), 3\u201324 (2001)","journal-title":"J. Sched."},{"issue":"8","key":"2_CR11","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1080\/07408170590918290","volume":"37","author":"CY Lee","year":"2005","unstructured":"Lee, C.Y., Strusevich, V.A.: Two-machine shop scheduling with an uncapacitated interstage transporter. IIE Trans. 37(8), 725\u2013736 (2005)","journal-title":"IIE Trans."},{"key":"2_CR12","first-page":"1","volume":"12","author":"P Maggu","year":"1980","unstructured":"Maggu, P., Das, G.: On 2$$\\times $$ n sequencing problem with transportation times of jobs. Pure Appl. Mathematika Sci. 12, 1\u20136 (1980)","journal-title":"Pure Appl. Mathematika Sci."},{"issue":"6","key":"2_CR13","doi-asserted-by":"publisher","first-page":"1436","DOI":"10.1287\/opre.28.6.1436","volume":"28","author":"CN Potts","year":"1980","unstructured":"Potts, C.N.: Analysis of a heuristic for one machine sequencing with release dates and delivery times. Oper. Res. 28(6), 1436\u20131441 (1980)","journal-title":"Oper. Res."},{"issue":"2","key":"2_CR14","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/j.cie.2009.07.014","volume":"58","author":"L Tang","year":"2010","unstructured":"Tang, L., Guan, J., Hu, G.: Steelmaking and refining coordinated scheduling problem with waiting time and transportation consideration. Comput. Ind. Eng. 58(2), 239\u2013248 (2010)","journal-title":"Comput. Ind. Eng."},{"issue":"3","key":"2_CR15","doi-asserted-by":"publisher","first-page":"918","DOI":"10.1016\/j.ejor.2005.08.034","volume":"178","author":"J Yuan","year":"2007","unstructured":"Yuan, J., Soukhal, A., Chen, Y., Lu, L.: A note on the complexity of flow shop scheduling with transportation constraints. Eur. J. Oper. Res. 178(3), 918\u2013925 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"2_CR16","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/s10951-014-0409-6","volume":"18","author":"W Zhong","year":"2015","unstructured":"Zhong, W., Chen, Z.L.: Flowshop scheduling with interstage job transportation. J. Sched. 18(4), 411\u2013422 (2015)","journal-title":"J. Sched."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22105-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,30]],"date-time":"2023-03-30T22:03:09Z","timestamp":1680213789000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22105-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031221040","9783031221057"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22105-7_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenzhen","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2022\/","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":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"101","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":"39","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":"12","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":"39% - 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":"5","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)"}}]}}