{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T16:19:16Z","timestamp":1773505156508,"version":"3.50.1"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[2001,10,1]],"date-time":"2001-10-01T00:00:00Z","timestamp":1001894400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,10,1]],"date-time":"2001-10-01T00:00:00Z","timestamp":1001894400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Operations Research"],"published-print":{"date-parts":[[2001,10]]},"DOI":"10.1023\/a:1014938712999","type":"journal-article","created":{"date-parts":[[2002,12,28]],"date-time":"2002-12-28T21:55:50Z","timestamp":1041112550000},"page":"51-63","source":"Crossref","is-referenced-by-count":16,"title":["Single Supplier Scheduling for Multiple Deliveries"],"prefix":"10.1007","volume":"107","author":[{"given":"T.C. Edwin","family":"Cheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mikhail Y.","family":"Kovalyov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"399507_CR1","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/S0305-0483(98)00042-5","volume":"27","author":"A. Allahverdi","year":"1999","unstructured":"A. Allahverdi, J.N.D. Gupta and T. Aldowaisan, A review of scheduling research involving setup considerations, Omega 27 (1999) 219\u2013239.","journal-title":"Omega"},{"key":"399507_CR2","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1137\/0207031","volume":"7","author":"J. Bruno","year":"1978","unstructured":"J. Bruno and P. Downey, Complexity of task sequencing with deadlines, set-up times and changeover costs, SIAM Journal of Computing 7 (1978) 393\u2013404.","journal-title":"SIAM Journal of Computing"},{"key":"399507_CR3","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0377-2217(96)00127-0","volume":"94","author":"T.C.E. Cheng","year":"1996","unstructured":"T.C.E. Cheng, V.S. Gordon and M.Y. Kovalyov, Single machine scheduling with batch deliveries, European Journal of Operational Research 94 (1996) 277\u2013283.","journal-title":"European Journal of Operational Research"},{"key":"399507_CR4","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1137\/S1052623494269540","volume":"7","author":"T.C.E. Cheng","year":"1997","unstructured":"T.C.E. Cheng, M.Y. Kovalyov and B.M.T. Lin, Single machine scheduling to minimize batch delivery and job earliness penalties, SIAM Journal on Optimization 7 (1997) 547\u2013559.","journal-title":"SIAM Journal on Optimization"},{"key":"399507_CR5","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, 1979)."},{"key":"399507_CR6","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1287\/opre.36.1.50","volume":"36","author":"A. Gascon","year":"1988","unstructured":"A. Gascon and R.C. Leachman, A dynamic programming solution to the dynamic, multi-item, singlemachine scheduling problem, Operations Research 36 (1988) 50\u201356.","journal-title":"Operations Research"},{"key":"399507_CR7","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1287\/opre.16.2.342","volume":"16","author":"C.R. Glassey","year":"1968","unstructured":"C.R. Glassey, Minimum change-over scheduling of several products on one machine, Operations Research 16 (1968) 342\u2013352.","journal-title":"Operations Research"},{"key":"399507_CR8","unstructured":"N.G. Hall and C.N. Potts, Supply chain scheduling: batching and delivery, in: Seventh International Workshop on Project Management and Scheduling (PMS 2000), Osnabruck, Germany (April 17-19, 2000) pp. 18-21."},{"key":"399507_CR9","series-title":"Research Report","volume-title":"Scheduling a production line to minimize maximum tardiness","author":"J.R. Jackson","year":"1955","unstructured":"J.R. Jackson, Scheduling a production line to minimize maximum tardiness, Research Report 43, Management Science Research Project, University of California, Los Angeles (1955)."},{"key":"399507_CR10","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/S0377-2217(99)00153-8","volume":"120","author":"C.N. Potts","year":"2000","unstructured":"C.N. Potts and M.Y. Kovalyov, Scheduling with batching: a review, European Journal of Operational Research 120 (2000) 228\u2013249.","journal-title":"European Journal of Operational Research"},{"key":"399507_CR11","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1057\/jors.1992.66","volume":"43","author":"C.N. Potts","year":"1992","unstructured":"C.N. Potts and L.N. Van Wassenhove, Integrating scheduling with batching and lot-sizing: a review of algorithms and complexity, Journal of the Operational Research Society 43 (1992) 395\u2013406.","journal-title":"Journal of the Operational Research Society"},{"key":"399507_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0377-2217(96)00098-7","volume":"94","author":"D.J. Thomas","year":"1996","unstructured":"D.J. Thomas and P.M. Griffin, Coordinated supply chain management, European Journal of Operations Research 94 (1996) 1\u201315.","journal-title":"European Journal of Operations Research"},{"key":"399507_CR13","doi-asserted-by":"crossref","first-page":"692","DOI":"10.1287\/opre.43.4.692","volume":"43","author":"S. Webster","year":"1995","unstructured":"S. Webster and K.R. Baker, Scheduling groups of jobs on a single machine, Operations Research 43 (1995) 692\u2013703.","journal-title":"Operations Research"},{"key":"399507_CR14","doi-asserted-by":"crossref","unstructured":"X. Yang, Scheduling with generalized batch delivery dates and earliness penalties, IIE Transactions (2001) to appear.","DOI":"10.1080\/07408170008967431"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1014938712999.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1014938712999\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1014938712999.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T14:10:31Z","timestamp":1747577431000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1014938712999"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,10]]},"references-count":14,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2001,10]]}},"alternative-id":["399507"],"URL":"https:\/\/doi.org\/10.1023\/a:1014938712999","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,10]]}}}