Abstract
We consider the problem of scheduling a set of n tasks on a single processor. Each task has a processing time, a deadline, a flow time penalty and an earliness penalty. The objective is to minimize the total cost incurred by the penalties. The problem is NP-hard in the strong sense. Exact enumerative algorithms from the literature can solve random instances with n ≤ 50. We study a tabu search approach to the approximate solution of the problem and show, through computational experiments, that instance with n = 300 are effectively solved with short computing times.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
K.R. Baker and G. Scudder, Sequencing with Earliness and Tardiness Penalties: a Review, Operations Research 38 (1990), p. 22.
J. Bard, K. Venkatraman and T. Feo, Single Machine Scheduling Problem with Due Dates and Earliness Penalties, Journal of Global Optimization 3 (1993), p. 289.
M. Dell’Amico, Optimal Idle Time Insertion in One Machine Scheduling Problems, Tech. Report, Politecnico di Milano (1994).
M. Dell’Amico, S. Martello and D. Vigo, Minimizing the Sum of Weighted Completion Times with Unrestricted Weights, Discrete Applied Mathematics, to appear (1995).
T. Feo, K. Venkatraman and J. Bard, A GRASP for a Difficult Single Machine Scheduling Problem, Computers and Operations Research 18 (1991), p. 378.
F. Glover and M. Laguna, Tabu Search in: Modern Heuristic Tech-niques for Combinatorial Problems, ed. C.R. Reeves (Black-well Scientific Publications, Oxford, 1993).
J.R. Jackson, Scheduling a Production Line to Minimize Maximum Tardiness, Research Report 43, Management Science Research Project, University of California, Los Angeles (1955).
J.K. Lenstra, A.H.G. Rinnooy Kan and P. Brucker, Complexity of Machine Scheduling Problems, Annals of Discrete Mathematics 1 (1977), p. 343.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Kluwer Academic Publishers
About this chapter
Cite this chapter
Dell’Amico, M., Martello, S., Vigo, D. (1996). Heuristic Algorithms for Single Processor Scheduling with Earliness and Flow Time Penalties. In: Osman, I.H., Kelly, J.P. (eds) Meta-Heuristics. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-1361-8_11
Download citation
DOI: https://doi.org/10.1007/978-1-4613-1361-8_11
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-8587-8
Online ISBN: 978-1-4613-1361-8
eBook Packages: Springer Book Archive