Abstract
In this paper we consider the problem of scheduling n jobs on a single machine, where the jobs are processed in batches and the processing time of each job is a step function depending on its waiting time, which is the time between the start of the processing of the batch to which the job belongs and the start of the processing of the job. For job i, if its waiting time is less than a given threshold value D, then it requires a basic processing time a i ; otherwise, it requires an extended processing time a i +b i . The objective is to minimize the completion time of the last job. We first show that the problem is NP-hard in the strong sense even if all b i are equal, it is NP-hard even if b i =a i for all i, and it is non-approximable in polynomial time with a constant performance guarantee Δ<3/2, unless \(\mathcal {P}=\mathcal{NP}\) . We then present O(nlog n) and O(n 3F−1log n/F F) algorithms for the case where all a i are equal and for the case where there are F, F≥2, distinct values of a i , respectively. We further propose an O(n 2log n) approximation algorithm with a performance guarantee \(\Delta\le1+\lfloor\frac{m^{*}}{2}\rfloor/m^{*}\le3/2\) for the general problem, where m * is the number of batches in an optimal schedule. All the above results apply or can be easily modified for the corresponding open-end bin packing problem.
Similar content being viewed by others
References
Alidaee, B., & Womer, N. K. (1999). Scheduling with time dependent processing times: review and extensions. Journal of the Operational Research Society, 50, 711–720.
Allahverdi, A., Ng, C. T., Cheng, T. C. E., & Kovalyov, M. Y. (2006, in press). A review of scheduling problems with setup times or costs. European Journal of Operational Research, available online 13 November 2006.
Cheng, T. C. E., & Ding, Q. (2001). Single machine scheduling with step-deteriorating processing times. European Journal of Operational Research, 134, 623–630.
Cheng, T. C. E., Gordon, V. S., & Kovalyov, M. Y. (1996). Single machine scheduling with batch deliveries. European Journal of Operations Research, 94, 277–283.
Cheng, T. C. E., Ding, Q., & Lin, B. M. T. (2004). A concise survey of scheduling with time-dependent processing times. European Journal of Operational Research, 152, 1–13.
Gawiejnowicz, S. (1996). Brief survey of continuous models of scheduling. Foundations of Computer and Decision Science, 21, 81–100.
Inderfurth, K., Janiak, A., Kovalyov, M. Y., & Werner, F. (2006). Batching work and rework processes with limited deterioration of reworkables. Computers and Operations Research, 33, 1595–1605.
Karmarkar, N., & Karp, R. M. (1982). An efficient approximation scheme for the one-dimensional bin packing problem. In Proceedings of the 23rd annual symposium on foundations of computer science (pp. 312–320). Long Beach: IEEE Computer Society.
Leung, J. Y.-T. (1982). On scheduling independent tasks with restricted execution times. Operations Research, 30, 163–171.
Leung, J. Y.-T., Dror, M., & Young, G. H. (2001). A note on an open-end bin packing problem. Journal of Scheduling, 4, 201–207.
Melnikov, O. I., & Shafransky, Y. M. (1980). Parametric problem of scheduling theory. Cybernetics, 15, 352–357 (in Russian).
Potts, C. N., & Kovalyov, M. Y. (2000). Scheduling with batching: a review. European Journal of Operational Research, 120, 228–249.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Barketau, M.S., Cheng, T.C.E., Ng, C.T. et al. Batch scheduling of step deteriorating jobs. J Sched 11, 17–28 (2008). https://doi.org/10.1007/s10951-007-0047-3
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10951-007-0047-3