{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:35:04Z","timestamp":1761597304772},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,10,18]],"date-time":"2011-10-18T00:00:00Z","timestamp":1318896000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2013,2]]},"DOI":"10.1007\/s10951-011-0255-8","type":"journal-article","created":{"date-parts":[[2011,10,17]],"date-time":"2011-10-17T17:03:44Z","timestamp":1318871024000},"page":"69-79","source":"Crossref","is-referenced-by-count":18,"title":["Single machine batch scheduling with release times and delivery costs"],"prefix":"10.1007","volume":"16","author":[{"given":"Esaignani","family":"Selvarajah","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George","family":"Steiner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rui","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,10,18]]},"reference":[{"key":"255_CR1","volume-title":"Proc. 40th annual symposium on foundations of computer science","author":"F. Afrati","year":"1999","unstructured":"Afrati, F., Bampis, E., Chekuri, C., Karger, D., Kenyon, C., Khanna, S., Milis, I., Queyranne, M., Skutella, M., Stein, C., & Sviridenko (1999). Approximation schemes for minimizing average weighted completion time with release dates. In Proc. 40th annual symposium on foundations of computer science"},{"key":"255_CR2","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., & Brucker, P. (1993). The complexity of one-machine batching problems. Discrete Applied Mathematics, 47, 87\u2013107.","journal-title":"Discrete Applied Mathematics"},{"key":"255_CR3","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/S0305-0483(98)00042-5","volume":"27","author":"A. Allahverdi","year":"1999","unstructured":"Allahverdi, A., Gupta, J. N. D., & Aldowaisan, T. (1999). A review of scheduling research involving setup considerations. Omega, 27, 219\u2013239.","journal-title":"Omega"},{"key":"255_CR4","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1016\/j.ejor.2006.06.060","volume":"187","author":"A. Allahverdi","year":"2008","unstructured":"Allahverdi, A., Ng, C. T., Cheng, T. C. E., & Kovalyov, M. Y. (2008). A survey of scheduling problems with setup times or costs. European Journal of Operational Research, 187, 985\u20131032.","journal-title":"European Journal of Operational Research"},{"key":"255_CR5","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","volume":"6","author":"J. C. Bean","year":"1994","unstructured":"Bean, J. C. (1994). Genetic algorithms and random keys for sequencing and optimization. ORSA Journal on Computing, 6, 154\u2013160.","journal-title":"ORSA Journal on Computing"},{"key":"255_CR6","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/S0097539797327180","volume":"31","author":"C. Chekuri","year":"2001","unstructured":"Chekuri, C., Motwani, R., Natarajan, B., & Stein, C. (2001). Approximation techniques for average completion time scheduling. SIAM Journal on Computing, 31, 146\u2013166.","journal-title":"SIAM Journal on Computing"},{"key":"255_CR7","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0167-6377(92)90092-H","volume":"12","author":"C. Chu","year":"1992","unstructured":"Chu, C. (1992a). Efficient heuristics to minimize total flow time with release dates. Operations Research Letters, 12, 321\u2013330.","journal-title":"Operations Research Letters"},{"key":"255_CR8","doi-asserted-by":"crossref","first-page":"859","DOI":"10.1002\/1520-6750(199210)39:6<859::AID-NAV3220390610>3.0.CO;2-W","volume":"39","author":"C. Chu","year":"1992","unstructured":"Chu, C. (1992b). A branch-and-bound algorithm to minimize total flow time with unequal release dates. Naval Research Logistics, 39, 859\u2013875.","journal-title":"Naval Research Logistics"},{"key":"255_CR9","first-page":"135","volume":"26","author":"E. G. Coffman","year":"1990","unstructured":"Coffman, E. G., Yannakakis, M., Magazine, M. J., & Santos, C. (1990). Batch sizing and job sequencing on a single machine. Naval Research Logistics, 26, 135\u2013147.","journal-title":"Naval Research Logistics"},{"key":"255_CR10","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0166-218X(90)90104-K","volume":"26","author":"M. E. Dyer","year":"1990","unstructured":"Dyer, M. E., & Wolsey, L. A. (1990). Formulating the single machine sequencing problem with release dates as a mixed integer program. Discrete Applied Mathematics, 26, 255\u2013270.","journal-title":"Discrete Applied Mathematics"},{"key":"255_CR11","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/s10878-007-9114-0","volume":"17","author":"B. Gfeller","year":"2009","unstructured":"Gfeller, B., Peeters, L., Weber, B., & Widmayer, P. (2009). Single machine batch scheduling with release times. Journal of Combinatorial Optimization, 17, 323\u2013338.","journal-title":"Journal of Combinatorial Optimization"},{"key":"255_CR12","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0167-6377(00)00024-9","volume":"26","author":"M. X. Goemans","year":"2000","unstructured":"Goemans, M. X., Wein, J. M., & Williamson, D. P. (2000). A\u00a01.47-approximation algorithm for a preemptive single-machine scheduling problem. Operations Research Letters, 26, 149\u2013154.","journal-title":"Operations Research Letters"},{"key":"255_CR13","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"4","author":"R. L. Graham","year":"1979","unstructured":"Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy\u00a0Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 4, 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"key":"255_CR14","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., & Potts, C. N. (2003). Supply chain scheduling: Batching and delivery. Operations Research, 51, 566\u2013584.","journal-title":"Operations Research"},{"key":"255_CR15","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0166-218X(83)90019-7","volume":"5","author":"A. M. A. Hariri","year":"1983","unstructured":"Hariri, A. M. A., & Potts, C. N. (1983). An algorithm for single machine sequencing with release times to minimize total weighted completion time. Discrete Applied Mathematics, 5, 99\u2013109.","journal-title":"Discrete Applied Mathematics"},{"key":"255_CR16","doi-asserted-by":"crossref","first-page":"1155","DOI":"10.1137\/S0097539796305778","volume":"28","author":"H. Kellerer","year":"1999","unstructured":"Kellerer, H., Tautenhahn, T., & Woeginger, G. J. (1999). Approximability and nonapproximability results for minimizing total flow time on single machine. SIAM Journal on Computing, 28, 1155\u20131166.","journal-title":"SIAM Journal on Computing"},{"key":"255_CR17","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/B978-0-12-566780-7.50020-9","volume-title":"Progress in combinatorial optimization","author":"J. Labetoulle","year":"1984","unstructured":"Labetoulle, J., Lawler, E. L., Lenstra, J. K., & Rinnooy\u00a0Kan, A. H. G. (1984). Preemptive scheduling of uniform machines subject to release dates. In W. R. Pulleyblank (Ed.), Progress in combinatorial optimization (pp. 245\u2013261). New York: Academic Press."},{"key":"255_CR18","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1016\/j.omega.2010.01.001","volume":"38","author":"I. S. Lee","year":"2010","unstructured":"Lee, I. S., & Yoon, S. H. (2010). Coordinated scheduling of production and delivery stages with stage-dependent inventory holding costs. Omega, 38, 509\u2013521.","journal-title":"Omega"},{"key":"255_CR19","first-page":"343","volume":"1","author":"J. K. Lenstra","year":"1977","unstructured":"Lenstra, J. K., Rinnooy\u00a0Kan, A. H. G., & Brucker, P. (1977). Complexity of machine scheduling problems. Annals of Operations Research, 1, 343\u2013362.","journal-title":"Annals of Operations Research"},{"key":"255_CR20","doi-asserted-by":"crossref","first-page":"1099","DOI":"10.1016\/j.cor.2006.07.006","volume":"35","author":"M. M. Mazdeh","year":"2008","unstructured":"Mazdeh, M. M., Sarhadi, M., & Hindi, K. S. (2008). A branch-and-bound algorithm for single-machine scheduling with batch delivery and job release times. Computers & Operations Research, 35, 1099\u20131111.","journal-title":"Computers & Operations Research"},{"key":"255_CR21","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., & Kovalyov, Y. M. (2000). Scheduling with batching: a review. European Journal of Operational Research, 120, 228\u2013249.","journal-title":"European Journal of Operational Research"},{"key":"255_CR22","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1287\/opre.16.3.687","volume":"16","author":"L. Schrage","year":"1968","unstructured":"Schrage, L. (1968). A proof of the shortest remaining processing time processing discipline. Operations Research, 16, 687\u2013690.","journal-title":"Operations Research"},{"key":"255_CR23","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"W. E. Smith","year":"1956","unstructured":"Smith, W. E. (1956). Various optimizers for single-stage production. Naval Research Logistics, 3, 59\u201366.","journal-title":"Naval Research Logistics"},{"key":"255_CR24","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1137\/S0895480198343418","volume":"13","author":"G. Steiner","year":"2000","unstructured":"Steiner, G., & Stephenson, P. (2000). Subset-restricted interchange for dynamic min-max scheduling problems. SIAM Journal on Discrete Mathematics, 13, 419\u2013435.","journal-title":"SIAM Journal on Discrete Mathematics"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-011-0255-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-011-0255-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-011-0255-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T05:39:46Z","timestamp":1559453986000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-011-0255-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10,18]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,2]]}},"alternative-id":["255"],"URL":"https:\/\/doi.org\/10.1007\/s10951-011-0255-8","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,10,18]]}}}