{"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":1759639089490},"publisher-location":"Singapore","reference-count":17,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811327117"},{"type":"electronic","value":"9789811327124"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-981-13-2712-4_9","type":"book-chapter","created":{"date-parts":[[2018,9,25]],"date-time":"2018-09-25T15:37:15Z","timestamp":1537889835000},"page":"116-140","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A New Approximation Algorithm for\u00a0Flow Shop with Transporter Coordinate"],"prefix":"10.1007","author":[{"given":"Xin","family":"Han","sequence":"first","affiliation":[]},{"given":"Yinling","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,9,26]]},"reference":[{"issue":"10","key":"9_CR1","doi-asserted-by":"publisher","first-page":"1211","DOI":"10.1057\/jors.1994.191","volume":"45","author":"TCE Cheng","year":"1994","unstructured":"Cheng, T.C.E., Gordon, V.S.: Batch delivery scheduling on a single machine. J. Oper. Res. Soc. 45(10), 1211\u20131216 (1994)","journal-title":"J. Oper. Res. Soc."},{"issue":"3","key":"9_CR2","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."},{"key":"9_CR3","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 & Co., New York (1979)"},{"issue":"9","key":"9_CR4","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":"9_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, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discret. Math. 5(1), 287\u2013326 (1979)","journal-title":"Ann. Discret. Math."},{"issue":"1","key":"9_CR6","first-page":"175","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."},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Hall, L.A., Shmoys, D.B.: Approximation schemes for constrained scheduling problems. In: 1989 30th Annual Symposium on Foundations of Computer Science, pp. 134\u2013139. IEEE (1989)","DOI":"10.1109\/SFCS.1989.63468"},{"issue":"1","key":"9_CR8","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), 199\u2013216 (2001)","journal-title":"Discret. Appl. Math."},{"issue":"4","key":"9_CR9","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1137\/0203025","volume":"3","author":"DS Johnson","year":"1974","unstructured":"Johnson, D.S., Demers, A., Ullman, J.D., Garey, M.R., Graham, R.L.: Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM J. Comput. 3(4), 299\u2013325 (1974)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"9_CR10","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}|v=1, c=2|{C}_{max}$$. Inf. Process. Lett. 116(1), 65\u201369 (2016)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"9_CR11","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":"1","key":"9_CR12","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."},{"issue":"6","key":"9_CR13","first-page":"574","volume":"12","author":"PL Maggu","year":"1980","unstructured":"Maggu, P.L., Das, G.: On $$2\\times n$$ sequencing problem with transportation times of jobs. Am. J. Ind. Med. 12(6), 574\u201383 (1980)","journal-title":"Am. J. Ind. Med."},{"issue":"4","key":"9_CR14","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1002\/1520-6750(199406)41:4<579::AID-NAV3220410409>3.0.CO;2-G","volume":"41","author":"D Simchi-Levi","year":"1994","unstructured":"Simchi-Levi, D.: New worst-case results for the bin-packing problem. Nav. Res. Logist. 41(4), 579 (1994)","journal-title":"Nav. Res. Logist."},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Vaidya, P.M.: Speeding-up linear programming using fast matrix multiplication. In: Proceedings of the 30th Annual Symposium on Foundations of Computer Science, pp. 332\u2013337 (1989)","DOI":"10.1109\/SFCS.1989.63499"},{"issue":"2","key":"9_CR16","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1016\/S0377-2217(03)00364-3","volume":"158","author":"Y-C Chang","year":"2004","unstructured":"Chang, Y.-C., Lee, C.Y.: Machine scheduling with job delivery coordination. Eur. J. Oper. Res. 158(2), 470\u2013487 (2004)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"9_CR17","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":["Communications in Computer and Information Science","Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-13-2712-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,24]],"date-time":"2019-10-24T21:01:31Z","timestamp":1571950891000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-13-2712-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9789811327117","9789811327124"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-981-13-2712-4_9","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"NCTCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"National Conference of Theoretical Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shanghai","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 October 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"36","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"nctcs2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/itcs.shufe.edu.cn\/nctcs2018\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}