Tabu Search Heuristics for Parallel Machine Scheduling with Sequence-Dependent Setup and Ready Times

  • Sang-Il Kim
  • Hyun-Seon Choi
  • Dong-Ho Lee
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3982)


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.


Parallel Machine Tabu List Total Tardiness Tabu Search Heuristic Parallel Machine Schedule Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bean, J.C.: Genetic algorithm and random keys for sequencing and optimization. ORSA Journal on Computing 6, 154–160 (1994)MATHGoogle Scholar
  2. 2.
    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)MATHCrossRefGoogle Scholar
  3. 3.
    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)MATHCrossRefGoogle Scholar
  4. 4.
    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)MATHCrossRefGoogle Scholar
  5. 5.
    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)Google Scholar
  6. 6.
    Du, J., Leung, J.Y.T.: Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research 15, 483–495 (1990)MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Glover, F.: Tabu Search: Part I. ORSA Journal on Computing 1, 190–206 (1989)MATHMathSciNetGoogle Scholar
  8. 8.
    Koulamas, C.: Decomposition and hybrid simulated annealing heuristics for the parallel machine total tardiness problem. Naval Research Logistics 44, 109–125 (1997)MATHCrossRefGoogle Scholar
  9. 9.
    Laguna, M., Barnes, J.W., Glover, F.: Tabu search methods for a single machine scheduling problem. Journal of Intelligent Manufacturing 2, 63–74 (1991)CrossRefGoogle Scholar
  10. 10.
    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)CrossRefGoogle Scholar
  11. 11.
    Sivrikaya-Serifoglu, F., Ulusoy, G.: Parallel machine scheduling with earliness and tardiness penalties. Computers and Operations Research 26, 773–787 (1999)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Sang-Il Kim
    • 1
  • Hyun-Seon Choi
    • 1
  • Dong-Ho Lee
    • 1
  1. 1.Department of Industrial EngineeringHanyang UniversitySungdong-gu, SeoulKorea

Personalised recommendations