Abstract
This paper introduces a general decomposition scheme for single stage scheduling problems with jobs that have arbitrary release dates. We assume that the objective function is monotone in the completion time of each job. The decomposition scheme has significant theoretical and practical relevance. When assuming equal processing times, we can reduce the number of steps required to solve several well-known nonpreemptive single machine scheduling problems by \(\mathcal{O}(n^{3})\), provided the processing time p is constant. Specifically, we develop new approaches that solve the problems 1|r i ,p i =p|∑f i (C i ) and 1|r i ,p i =p|∑w i U i in \(\mathcal{O}(n^{4})\) time; the algorithms that have been described in the literature for these problems operate in \(\mathcal{O}(n^{7})\). Moreover, solution approaches for \(\mathcal{NP}\)-hard problems with unequal processing times may also benefit from our decomposition rule. This is particularly true if p max/p min is close to 1. Using the decomposition rule, either the problem size is reduced or additional information about the maximal schedule length is obtained.
Similar content being viewed by others
References
Baptiste, P. (1999). Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing time. Journal of Scheduling, 2, 245–252.
Baptiste, P. (2000). Scheduling equal-length jobs on identical parallel machines. Discrete Applied Mathematics, 103, 21–32.
Baptiste, P., & Brucker, P. (2004). Scheduling equal processing time jobs. In J. Y-T. Leung (Ed.), Handbook of scheduling—algorithms, models, and performance analysis: 14-1–14-37.
Baptiste, P., & Timkovsky, V. (2004). Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time. Mathematical Methods of Operations Research (ZOR), 60, 145–153.
Baptiste, P., Brucker, P., Knust, S., & Timkovsky, V. G. (2004a). Ten notes on equal-processing-time scheduling. At the frontier of solvability in polynomial time. 4OR: Quarterly Journal of the Belgian, French and Italian Operations Research Societies, 2, 111–127.
Baptiste, P., Chrobak, M., Dürr, C., Jawor, W., & Vakhania, N. (2004b). Preemptive scheduling of equal-length jobs to maximize weighted throughput. Operation Research Letters, 32, 258–264.
Baptiste, P., Brucker, P., Chrobak, M., Dürr, C., Kravchenko, S. A., & Sourd, F. (2007). The complexity of mean flow time scheduling problems with release times. Journal of Scheduling, 10, 139–146.
Bock, S., & Pinedo, M. (2007). A decomposition technique for speeding up single stage scheduling algorithms using parallel machines (Working Paper of the Stern School of Business). New York.
Brucker, P., & Kravchenko, S. (2004). Scheduling jobs with equal processing times and time windows on identical parallel machines (Technical Report H257). University of Osnabrück.
Chand, S., Traub, R., & Uzsoy, R. (1996). Single-machine scheduling with dynamic arrivals: Decomposition results and an improved algorithm. Naval Research Logistics, 43, 709–719.
Chand, S., Traub, R., & Uzsoy, R. (1997). Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with release dates. Annals of Operations Research, 70, 115–125.
Chrobak, M., Dürr, C., Jawor, W., Kowalik, L., & Kurowski, M. (2006). A note on scheduling equal-length jobs to maximize throughput. Journal of Scheduling, 9, 71–73.
Cormen, T. H., Leiserson, C. E., & Rivest, R. L. (2009). Introduction to algorithms (3rd ed.). Cambridge: The MIT Press.
Du, J., & Leung, J. Y.-T. (1990). Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research, 15, 483–495.
Dürr, C., & Hurand, M. (2006). Finding total unimodularity in optimization problems solved by linear programs. In Proceedings of the 14th annual european symposium on algorithms (ESA) (pp. 315–326).
Lenstra, J. K., Rinnoy Kan, A. H. G., & Brucker, P. (1977). Complexity of machine scheduling problems. Annals of Discrete Mathematics, 1, 343–362.
Kellerer, H. (2004). Minimizing the maximum lateness. In J. Y.-T. Leung (Ed.), Handbook of scheduling—algorithms, models, and performance analysis: 10-1–10-12.
Pinedo, M. (2005). Planning and scheduling in manufacturing and services. New York: Springer.
Pinedo, M. (2008). Scheduling: theory, algorithms, and systems (3rd ed.). New York: Springer.
Scholl, A. (1999). Balancing and sequencing of assembly lines (2nd ed.). New York: Physica.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Bock, S., Pinedo, M. A decomposition scheme for single stage scheduling problems. J Sched 13, 203–212 (2010). https://doi.org/10.1007/s10951-010-0165-1
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10951-010-0165-1