{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T19:59:48Z","timestamp":1771012788984,"version":"3.50.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2005,3,1]],"date-time":"2005-03-01T00:00:00Z","timestamp":1109635200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2005,3]]},"DOI":"10.1007\/s10479-005-6234-8","type":"journal-article","created":{"date-parts":[[2005,5,3]],"date-time":"2005-05-03T05:50:06Z","timestamp":1115099406000},"page":"41-64","source":"Crossref","is-referenced-by-count":76,"title":["The Coordination of Scheduling and Batch Deliveries"],"prefix":"10.1007","volume":"135","author":[{"given":"Nicholas G.","family":"Hall","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chris N.","family":"Potts","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6234_CR1","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0166-218X(93)90085-3","volume":"47","author":"S. Albers","year":"1993","unstructured":"Albers, S. and P. Brucker. (1993). \u201cThe Complexity of One-Machine Batching Problems.\u201d Discrete Applied Mathematics 47, 87\u2013107.","journal-title":"Discrete Applied Mathematics"},{"key":"6234_CR2","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1137\/0207031","volume":"7","author":"J. Bruno","year":"1978","unstructured":"Bruno, J. and P. Downey. (1978). \u201cComplexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs.\u201d SIAM Journal on Computing 7, 393\u2013404.","journal-title":"SIAM Journal on Computing"},{"key":"6234_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":"Cheng, T.C.E., V.S. Gordon, and M.Y. Kovalyov. (1996). \u201cSingle Machine Scheduling with Batch Deliveries.\u201d European Journal of Operational Research 94, 277\u2013283.","journal-title":"European Journal of Operational Research"},{"key":"6234_CR4","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1287\/moor.15.3.483","volume":"15","author":"J. Du","year":"1990","unstructured":"Du, J. and J.Y.-T. Leung. (1990). \u201cMinimizing Total Tardiness on One Machine is NP-Hard.\u201d Mathematics of Operations Research 15, 483\u2013495.","journal-title":"Mathematics of Operations Research"},{"key":"6234_CR5","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R. and D.S. Johnson. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco: W.H. Freeman."},{"key":"6234_CR6","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R.L. Graham","year":"1979","unstructured":"Graham, R.L., E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan. (1979). \u201cOptimization and Approximation in Deterministic Machine Scheduling: A Survey.\u201d Annals of Discrete Mathematics 5, 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"key":"6234_CR7","doi-asserted-by":"crossref","first-page":"854","DOI":"10.1287\/opre.49.6.854.10014","volume":"49","author":"N.G. Hall","year":"2001","unstructured":"Hall, N.G., M.A. Lesaoana, and C.N. Potts. (2001). \u201cScheduling with Fixed Delivery Dates.\u201d Operations Research 49, 854\u2013865.","journal-title":"Operations Research"},{"key":"6234_CR8","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1287\/opre.51.4.566.16106","volume":"51","author":"N.G. Hall","year":"2003","unstructured":"Hall, N.G. and C.N. Potts. (2003). \u201cSupply Chain Scheduling: Batching and Delivery.\u201d Operations Research 51, 566\u2013584.","journal-title":"Operations Research"},{"key":"6234_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-009-4976-8","volume-title":"Group Technology: Applications to Production Management","author":"I. Ham","year":"1985","unstructured":"Ham, I., K. Hitomi, and T. Yoshida. (1985). Group Technology: Applications to Production Management. Boston, MA: Kluwer-Nijhoff."},{"key":"6234_CR10","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/0377-2217(93)90239-J","volume":"70","author":"J. Herrmann","year":"1993","unstructured":"Herrmann, J. and C.-Y. Lee. (1993). \u201cOn Scheduling to Minimize Earliness-Tardiness and Batch Delivery Costs with a Common Due Date.\u201d European Journal of Operational Research 70, 272\u2013288.","journal-title":"European Journal of Operational Research"},{"key":"6234_CR11","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R.M. Karp","year":"1972","unstructured":"Karp, R.M. (1972). \u201cReducibility among Combinatorial Problems.\u201d In R.E. Miller and J.W. Thatcher (eds.), Complexity of Computer Computations. New York: Plenum Press, pp. 85\u2013103."},{"key":"6234_CR12","volume-title":"Data Structures and Program Design","author":"R.L. Kruse","year":"1987","unstructured":"Kruse, R.L. (1987). Data Structures and Program Design, 2nd ed. Englewood Cliffs, NJ: Prentice-Hall.","edition":"2"},{"key":"6234_CR13","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/S0167-5060(08)70742-8","volume":"1","author":"E.L. Lawler","year":"1977","unstructured":"Lawler, E.L. (1977). \u201cA \u2018Pseudopolynomial\u2019 Time Algorithm for Sequencing Jobs to Minimize Total Tardiness.\u201d Annals of Discrete Mathematics 1, 331\u2013342.","journal-title":"Annals of Discrete Mathematics"},{"key":"6234_CR14","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1002\/1099-1425(200101\/02)4:1<3::AID-JOS57>3.0.CO;2-D","volume":"4","author":"C.-Y. Lee","year":"2001","unstructured":"Lee, C.-Y. and Z.-L. Chen. (2001). \u201cMachine Scheduling with Transportation Considerations.\u201d Journal of Scheduling 4, 3\u201324.","journal-title":"Journal of Scheduling"},{"key":"6234_CR15","doi-asserted-by":"crossref","first-page":"764","DOI":"10.1287\/opre.40.4.764","volume":"40","author":"C.-Y. Lee","year":"1992","unstructured":"Lee, C.-Y., R. Uzsoy, and L.A. Martin-Vega. (1992). \u201cEfficient Algorithms for Scheduling Semiconductor Burn-in Operations.\u201d Operations Research 40, 764\u2013775.","journal-title":"Operations Research"},{"key":"6234_CR16","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"J.K. Lenstra","year":"1977","unstructured":"Lenstra, J.K., A.H.G. Rinnooy Kan, and P. Brucker. (1977). \u201cComplexity of Machine Scheduling Problems.\u201d Annals of Discrete Mathematics 1, 343\u2013362.","journal-title":"Annals of Discrete Mathematics"},{"key":"6234_CR17","doi-asserted-by":"crossref","first-page":"798","DOI":"10.1287\/opre.37.5.798","volume":"37","author":"C.L. Monma","year":"1989","unstructured":"Monma, C.L. and C.N. Potts. (1989). \u201cOn the Complexity of Scheduling with Batch Setup Times.\u201d Operations Research 37, 798\u2013804.","journal-title":"Operations Research"},{"key":"6234_CR18","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1287\/mnsc.15.1.102","volume":"15","author":"J.M. Moore","year":"1968","unstructured":"Moore, J.M. (1968). \u201cAn n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs.\u201d Management Science 15, 102\u2013109.","journal-title":"Management Science"},{"key":"6234_CR19","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/S0377-2217(99)00153-8","volume":"120","author":"C.N. Potts","year":"2000","unstructured":"Potts, C.N. and M.Y. Kovalyov. (2000). \u201cScheduling with Batching: A Review.\u201d European Journal of Operational Research 120, 228\u2013249.","journal-title":"European Journal of Operational Research"},{"key":"6234_CR20","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1057\/jors.1992.66","volume":"43","author":"C.N. Potts","year":"1992","unstructured":"Potts, C.N. and L.N. Van Wassenhove. (1992). \u201cIntegrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity.\u201d Journal of the Operational Research Society 43, 395\u2013406.","journal-title":"Journal of the Operational Research Society"},{"key":"6234_CR21","doi-asserted-by":"crossref","first-page":"692","DOI":"10.1287\/opre.43.4.692","volume":"43","author":"S. Webster","year":"1995","unstructured":"Webster, S. and K.R. Baker. (1995). \u201cScheduling Groups of Jobs on a Single Machine.\u201d Operations Research 43, 692\u2013703.","journal-title":"Operations Research"},{"key":"6234_CR22","first-page":"735","volume":"32","author":"X. Yang","year":"2000","unstructured":"Yang, X. (2000). \u201cScheduling with Generalized Batch Delivery Dates and Earliness Penalties.\u201d IIE Transactions 32, 735\u2013742.","journal-title":"IIE Transactions"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-005-6234-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-005-6234-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-005-6234-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:59:35Z","timestamp":1559138375000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-005-6234-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,3]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,3]]}},"alternative-id":["6234"],"URL":"https:\/\/doi.org\/10.1007\/s10479-005-6234-8","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,3]]}}}