Abstract
We consider the problem of scheduling a set of independent jobs on parallel machines for the objective of minimizing total tardiness. Each job may have sequence-dependent setup and distinct ready times, i.e., the time at which the job is available for processing. Due to the complexity of the problem, tabu search heuristics are suggested that incorporate new methods to generate the neighborhood solutions. Three initial solution methods are also suggested. Computational experiments are done on a number of randomly generated test problems, and the results show that the tabu search heuristics suggested in this paper outperform the existing one.
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.
Similar content being viewed by others
References
Bean, J.C.: Genetic algorithm and random keys for sequencing and optimization. ORSA Journal on Computing 6, 154–160 (1994)
Bilge, U., Kirac, F., Kurtulan, M., Pekgun, P.: A tabu search algorithm for parallel machine total tardiness problem. Computers and Operations Research 31, 397–414 (2004)
Cao, D., Chen, M., Wan, G.: Parallel machine selection and job scheduling to minimize machine cost and job tardiness. Computers and Operations Research 32, 1995–2012 (2005)
Cheng, T.C.E., Sin, C.C.S.: A state-of-the-art review of parallel-machine scheduling research. European Journal of Operational Research 47, 271–292 (1990)
Dastidar, G.S., Nagi, R.: Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs. Computers and Operations Research 32, 2987–3005 (2004)
Du, J., Leung, J.Y.T.: Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research 15, 483–495 (1990)
Glover, F.: Tabu Search: Part I. ORSA Journal on Computing 1, 190–206 (1989)
Koulamas, C.: Decomposition and hybrid simulated annealing heuristics for the parallel machine total tardiness problem. Naval Research Logistics 44, 109–125 (1997)
Laguna, M., Barnes, J.W., Glover, F.: Tabu search methods for a single machine scheduling problem. Journal of Intelligent Manufacturing 2, 63–74 (1991)
Park, M.-W., Kim, Y.-D.: Search heuristics for a parallel machine scheduling problem with ready times and due dates. Computers and Industrial Engineering 33, 793–796 (1997)
Sivrikaya-Serifoglu, F., Ulusoy, G.: Parallel machine scheduling with earliness and tardiness penalties. Computers and Operations Research 26, 773–787 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, SI., Choi, HS., Lee, DH. (2006). Tabu Search Heuristics for Parallel Machine Scheduling with Sequence-Dependent Setup and Ready Times. In: Gavrilova, M., et al. Computational Science and Its Applications - ICCSA 2006. ICCSA 2006. Lecture Notes in Computer Science, vol 3982. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11751595_77
Download citation
DOI: https://doi.org/10.1007/11751595_77
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34075-1
Online ISBN: 978-3-540-34076-8
eBook Packages: Computer ScienceComputer Science (R0)