{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T12:05:38Z","timestamp":1784289938297,"version":"3.55.0"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,2,15]],"date-time":"2017-02-15T00:00:00Z","timestamp":1487116800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11501512"],"award-info":[{"award-number":["11501512"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"The Science Foundation of ZUST","award":["13062171-Y"],"award-info":[{"award-number":["13062171-Y"]}]},{"name":"The Science Foundation of ZSTU","award":["14062170-Y"],"award-info":[{"award-number":["14062170-Y"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61672323"],"award-info":[{"award-number":["61672323"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11271324"],"award-info":[{"award-number":["11271324"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11471286"],"award-info":[{"award-number":["11471286"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1007\/s10951-017-0508-2","type":"journal-article","created":{"date-parts":[[2017,2,15]],"date-time":"2017-02-15T05:39:42Z","timestamp":1487137182000},"page":"337-348","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Single machine scheduling with job delivery to multiple customers"],"prefix":"10.1007","volume":"21","author":[{"given":"Jianming","family":"Dong","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xueshi","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jueliang","family":"Hu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guohui","family":"Lin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,2,15]]},"reference":[{"key":"508_CR1","doi-asserted-by":"crossref","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. (2004). Machine scheduling with job delivery coordination. European Journal of Operational Research, 158, 470\u2013487.","journal-title":"European Journal of Operational Research"},{"key":"508_CR2","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/j.tcs.2013.09.007","volume":"510","author":"G D\u00f3sa","year":"2013","unstructured":"D\u00f3sa, G., Li, R., Han, X., & Tuza, Z. S. (2013). Tight absolute bound for first fit decreasing bin-packing: \n                        $${FFD}({L}) \\le 11\/9 \\ {OPT}({L}) + 6\/9$$\n                        \n                            \n                                \n                                    \n                                        F\n                                        F\n                                        D\n                                    \n                                    (\n                                    L\n                                    )\n                                    \u2264\n                                    11\n                                    \/\n                                    9\n                                    \n                                    \n                                        O\n                                        P\n                                        T\n                                    \n                                    (\n                                    L\n                                    )\n                                    +\n                                    6\n                                    \/\n                                    9\n                                \n                            \n                        \n                    . Theoretical Computer Science, 510, 13\u201361.","journal-title":"Theoretical Computer Science"},{"key":"508_CR3","unstructured":"D\u00f3sa, G., & Sgall, J. (2013). First fit bin packing: A tight analysis. In Proceedings of the 30th annual symposium on theoretical aspects of computer science, LIPIcs 20 (pp. 538\u2013549). Schloss Dagstuhl."},{"key":"508_CR4","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1137\/0404007","volume":"4","author":"DK Friesen","year":"1991","unstructured":"Friesen, D. K., & Langston, M. A. (1991). Analysis of a compound bin packing algorithm. SIAM Journal on Discrete Mathematics, 4, 61\u201379.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"508_CR5","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. (1979). Computers and intractability: A guide to the theory of NP-completeness. San Francisco: W. H. Freeman and Company."},{"key":"508_CR6","doi-asserted-by":"crossref","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, R. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annuals of Discrete Mathematics, 5, 287\u2013326.","journal-title":"Annuals of Discrete Mathematics"},{"key":"508_CR7","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/j.tcs.2006.04.014","volume":"363","author":"Y He","year":"2006","unstructured":"He, Y., Zhong, W., & Gu, H. (2006). Improved algorithms for two single machine scheduling problems. Theoretical Computer Science, 363, 257\u2013265.","journal-title":"Theoretical Computer Science"},{"key":"508_CR8","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"SM Johnson","year":"1954","unstructured":"Johnson, S. M. (1954). Optimal two- and three-machine production schedules with setup times included. Naval Research Logistics, 1, 61\u201368.","journal-title":"Naval Research Logistics"},{"key":"508_CR9","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/S0167-6377(98)00005-4","volume":"21","author":"H Kellerer","year":"1997","unstructured":"Kellerer, H., Kotov, V., Speranza, M. G., & Tuza, Zs. (1997). Semi on-line algorithms for the partition problem. Operations Research Letters, 21, 235\u2013242.","journal-title":"Operations Research Letters"},{"key":"508_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1142\/S0217595908001596","volume":"25","author":"L Lu","year":"2008","unstructured":"Lu, L., & Yuan, J. (2008). Single machine scheduling with job delivery to minimize makespan. Asia-Pacific Journal of Operational Research, 25, 1\u201310.","journal-title":"Asia-Pacific Journal of Operational Research"},{"key":"508_CR11","doi-asserted-by":"crossref","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. (1994). New worst-case results for the bin packing problem. Naval Research Logistics, 41, 579\u2013585.","journal-title":"Naval Research Logistics"},{"key":"508_CR12","volume-title":"Approximation algorithms","author":"V Vazirani","year":"2001","unstructured":"Vazirani, V. (2001). Approximation algorithms. NewYork: Springer."},{"key":"508_CR13","doi-asserted-by":"crossref","first-page":"1057","DOI":"10.1016\/j.ejor.2006.09.059","volume":"182","author":"W Zhong","year":"2007","unstructured":"Zhong, W., D\u00f3sa, G., & Tan, Z. (2007). On the machine scheduling problem with job delivery coordination. European Journal of Operational Research, 182, 1057\u20131072.","journal-title":"European Journal of Operational Research"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-017-0508-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-017-0508-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-017-0508-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,5,29]],"date-time":"2018-05-29T07:02:32Z","timestamp":1527577352000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-017-0508-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,15]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,6]]}},"alternative-id":["508"],"URL":"https:\/\/doi.org\/10.1007\/s10951-017-0508-2","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,2,15]]}}}