Abstract
We study single machine batch scheduling with release times. Our goal is to minimize the sum of weighted flow times (or completion times) and delivery costs. Since the problem is strongly \(\mathcal{NP}\)-hard even with no delivery cost and identical weights for all jobs, an approximation algorithm is presented for the problem with identical weights. This uses the polynomial time solution we give for the preemptive version of the problem. We also present an evolutionary metaheuristic algorithm for the general case. Computational results show very small gaps between the results of the metaheuristic and the lower bound.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
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
Albers, S., & Brucker, P. (1993). The complexity of one-machine batching problems. Discrete Applied Mathematics, 47, 87–107.
Allahverdi, A., Gupta, J. N. D., & Aldowaisan, T. (1999). A review of scheduling research involving setup considerations. Omega, 27, 219–239.
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–1032.
Bean, J. C. (1994). Genetic algorithms and random keys for sequencing and optimization. ORSA Journal on Computing, 6, 154–160.
Chekuri, C., Motwani, R., Natarajan, B., & Stein, C. (2001). Approximation techniques for average completion time scheduling. SIAM Journal on Computing, 31, 146–166.
Chu, C. (1992a). Efficient heuristics to minimize total flow time with release dates. Operations Research Letters, 12, 321–330.
Chu, C. (1992b). A branch-and-bound algorithm to minimize total flow time with unequal release dates. Naval Research Logistics, 39, 859–875.
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–147.
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–270.
Gfeller, B., Peeters, L., Weber, B., & Widmayer, P. (2009). Single machine batch scheduling with release times. Journal of Combinatorial Optimization, 17, 323–338.
Goemans, M. X., Wein, J. M., & Williamson, D. P. (2000). A 1.47-approximation algorithm for a preemptive single-machine scheduling problem. Operations Research Letters, 26, 149–154.
Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 4, 287–326.
Hall, N. G., & Potts, C. N. (2003). Supply chain scheduling: Batching and delivery. Operations Research, 51, 566–584.
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–109.
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–1166.
Labetoulle, J., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1984). Preemptive scheduling of uniform machines subject to release dates. In W. R. Pulleyblank (Ed.), Progress in combinatorial optimization (pp. 245–261). New York: Academic Press.
Lee, I. S., & Yoon, S. H. (2010). Coordinated scheduling of production and delivery stages with stage-dependent inventory holding costs. Omega, 38, 509–521.
Lenstra, J. K., Rinnooy Kan, A. H. G., & Brucker, P. (1977). Complexity of machine scheduling problems. Annals of Operations Research, 1, 343–362.
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–1111.
Potts, C. N., & Kovalyov, Y. M. (2000). Scheduling with batching: a review. European Journal of Operational Research, 120, 228–249.
Schrage, L. (1968). A proof of the shortest remaining processing time processing discipline. Operations Research, 16, 687–690.
Smith, W. E. (1956). Various optimizers for single-stage production. Naval Research Logistics, 3, 59–66.
Steiner, G., & Stephenson, P. (2000). Subset-restricted interchange for dynamic min-max scheduling problems. SIAM Journal on Discrete Mathematics, 13, 419–435.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Selvarajah, E., Steiner, G. & Zhang, R. Single machine batch scheduling with release times and delivery costs. J Sched 16, 69–79 (2013). https://doi.org/10.1007/s10951-011-0255-8
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10951-011-0255-8