Skip to main content
SpringerLink
Log in

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

  • Conference paper
Computational Science and Its Applications - ICCSA 2006 (ICCSA 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3982))

Included in the following conference series:

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

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 139.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bean, J.C.: Genetic algorithm and random keys for sequencing and optimization. ORSA Journal on Computing 6, 154–160 (1994)

    MATH  Google Scholar 

  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)

    Article  MATH  Google Scholar 

  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)

    Article  MATH  Google Scholar 

  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)

    Article  MATH  Google Scholar 

  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. Du, J., Leung, J.Y.T.: Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research 15, 483–495 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  7. Glover, F.: Tabu Search: Part I. ORSA Journal on Computing 1, 190–206 (1989)

    MATH  MathSciNet  Google Scholar 

  8. Koulamas, C.: Decomposition and hybrid simulated annealing heuristics for the parallel machine total tardiness problem. Naval Research Logistics 44, 109–125 (1997)

    Article  MATH  Google Scholar 

  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)

    Article  Google Scholar 

  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)

    Article  Google Scholar 

  11. Sivrikaya-Serifoglu, F., Ulusoy, G.: Parallel machine scheduling with earliness and tardiness penalties. Computers and Operations Research 26, 773–787 (1999)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, Hanyang University, Sungdong-gu, Seoul, 133-791, Korea

    Sang-Il Kim, Hyun-Seon Choi & Dong-Ho Lee

Authors
  1. Sang-Il Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hyun-Seon Choi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dong-Ho Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Calgary, 2500 University Drive N.W., T2N 1N4, Calgary, AB, Canada

    Marina Gavrilova

  2. Department of Mathematics and Computer Science, University of Perugia, via Vanvitelli, 1, I-06123, Perugia, Italy

    Osvaldo Gervasi

  3. William Norris Professor, Head of the Computer Science and Engineering Department, University of Minnesota, USA

    Vipin Kumar

  4. OptimaNumerics Ltd., Cathedral House, 23-31 Waring Street, BT1 2DX, Belfast, UK

    C. J. Kenneth Tan

  5. Clayton School of IT, Monash University, 3800, Clayton, Australia

    David Taniar

  6. Department of Chemistry, University of Perugia, Via Elce di Sotto, 8, I-06123, Perugia, Italy

    Antonio Laganá

  7. School of Computing, Soongsil University, Seoul, Korea

    Youngsong Mun

  8. School of Information and Communication Engineering, Sungkyunkwan University, Korea

    Hyunseung Choo

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation