Abstract
In this paper, we consider the problem of minimizing the total weighted tardiness of a set of jobs processed on a single processor. First, a lower bound based on a Lagrangian decomposition is presented. The particularity of this decomposition, based on a 0–1 time indexed formulation, is to be sensitive to the domain reduction of jobs which are proposed. A branch and bound strategy including these different components is proposed. The results obtained on problems from the literature can be favourably compared to previously works and seem to prove that a trade-off between a tight lower bound and time consuming in the enumeration process can be a good strategy.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Abdul-Razaq, T., C. Potts, and L. Van Wassenhove. (1990). “A Survey of Algorithms for the SingleMachine Total Weighted Tardiness Scheduling Problem.” Discrete Applied Mathematics 26, 235–253.
Congram, R., C. Potts, and S. van de Velde. (2002). “An Iterated Dynasearch Algorithm for the Single-Machine Weighted Tardiness Problem.” INFORMS Journal on Computing 14, 52–67.
Crauwels, A., C. Potts, and L. Van Wassenhove. (1998). “Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem.” INFORMS Journal on Computing 10, 341–350.
Emmons, H. (1969). “One-Machine Sequencing to Minimize Certain Functions of Jobs Tardiness.” Operations Research 17, 701–715.
Held, M. and R. Karp. (1971). “The Travelling Salesman Problem and Minimum Spanning Trees: Part II.” Mathematical Programming 1, 6–25.
Lawler, E. (1977). “A Pseudopolynomial Algorithm for Sequencing Jobs to Minimize Total Tardiness.” Annals of Discrete Mathematics 1, 331–342.
Lenstra, J., A. Rinnooy Kan, and P. Brucker. (1977). “Complexity of Machine Scheduling Problems.” Annals of Discrete Mathematics 1, 343–362.
Matsuo, H., C.J. Suh, and R.S. Sullivan. (1987). “A Controlled Search Simulated Annealing Method for the Single Machine Weighted Tardiness Problem.” Technical Report, Working Paper 87–12–2, University of Texas, Austin, TX.
Möhring, R., A. Schulz, F. Stork, and M. Uetz. (2000). “Solvinf Project Scheduling Problems by Minimum Cut Computations.” Technical Report, Report 680–2000, Technische Universität Berlin.
Potts, C. and L. Van Wassenhove. (1985). “A Branch and Bound Algorithm for the TotalWeighted Tardiness Problem.” Operation Research 2, 363–377.
Potts, C.N. and L. N. Van Wassenhove. (1991). “Single Machine Tardiness Sequencing Heuristics.” Operations Research 33, 363–377.
Rinnooy Kan, A., B. Lageweg, and J. Lenstra. (1975). “Minimizing Total Costs in One-Machine Scheduling.” Operations Research 23, 908–927.
Van Den Akker, J., C. Hurkens, and M. Savelsberg. (2000). “Time Indexed Formulations for Machine Scheduling Problems: Column Generation.” INFORMS Journal on Computing 12, 111–124.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Babu, P., Peridy, L. & Pinson, E. A Branch and Bound Algorithm to Minimize Total Weighted Tardiness on a Single Processor. Annals of Operations Research 129, 33–46 (2004). https://doi.org/10.1023/B:ANOR.0000030680.29037.d0
Issue Date:
DOI: https://doi.org/10.1023/B:ANOR.0000030680.29037.d0