Skip to main content
SpringerLink
Log in

Scheduling jobs on parallel machines: a restricted tabu search approach

  • Original Article
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

Many real scheduling problems are often much more complex than problems that are analytically tractable. The main difficulty in obtaining optimal job schedules arises from the existence of sequence dependent setup times among jobs and job release times. In this paper, we present a restricted tabu search algorithm that schedules jobs on parallel machines in order to minimise the maximum lateness of the jobs. The jobs have release times and due dates, and sequence-dependent setup times exist between the jobs. The parallel machines are either identical or non-identical in terms of the processing times of the jobs. The restricted tabu search algorithm employs a restricted search with the elimination of non-effective job moves, for finding the best neighbourhood schedule. The restricted search algorithm reduces search effort significantly while obtaining good quality final schedule. The experimental results show that the proposed algorithm obtains much better solutions more quickly than other heuristic algorithms such as the Rolling Horizon Procedure (RHP) heuristic, the basic tabu search and simulated annealing.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1.
Fig. 2.
Fig. 3.
Fig. 4.
Fig. 5.
Fig. 6.

Similar content being viewed by others

References

  1. Kim SC, Bobrowski PM (1994) Impact onsequence-dependent setup time on job shop scheduling performance. Int J Prod Res 32:1503–1520

    Google Scholar 

  2. Demirkol E, Uzsoy R (2000) Decomposition methods for reentrant flow shops with sequence-dependent setup times. J Sched 3:155–177

    Article  Google Scholar 

  3. Ovacik IM, Uzsoy R (1995) Rolling horizon procedures for dynamic parallel machine scheduling with sequence dependent setup times. Int J Prod Res 33:3173–3192

    Google Scholar 

  4. Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys DB (1993) Sequencing and scheduling: algorithms and complexity. In: Handbooks in Operations Research and Management Science: Logistics of Production and Inventory, North Holland, Amsterdam, pp 445–522

  5. Shin HJ, Kim CO, Kim SS (2002) A tabu search algorithm for a single machine scheduling with release times, due dates, and sequence–dependent setup times Int J Adv Manufact Technol 19:(11)859–866

  6. Ali A, Jatinder NDG, Tariq A (1999) A review of scheduling research involving setup considerations. Omega 27:219–239

    Article  Google Scholar 

  7. Parker RG, Deane RH, Holmes RA (1977) On the use of a vehicle routing algorithm for the parallel processor problems with sequence dependent changeover costs. AIIE Transact 9:155–160

    Google Scholar 

  8. Franca PM, Gendreau M, Laporte G, Muller FM (1996) A tabu search heuristic for the multiprocessor scheduling problem with sequence dependent setup times. Int J Prod Econ 43:79–89

    Article  Google Scholar 

  9. Gendreau M, Hertz A, Laporte G (1992) New insertion and post-optimization procedures for the traveling salesman problem. Oper Res 40:1086–1094

    Google Scholar 

  10. Guinet A (1993) Scheduling sequence-dependent jobs on identical parallel machines to minimize completion time criteria. Int J Prod Res 31:1579–1594

    Google Scholar 

  11. Lee YH, Pinedo M (1997) Scheduling jobs on parallel machines with sequence-dependent setup times. Eur J Oper Res 100:464–474

    Article  Google Scholar 

  12. Glover F (1989) Tabu search—Part I. ORSA J Comput 1:190–206

    Google Scholar 

  13. Glover F (1990) Tabu search—Part II. ORSA J Comput 2:4–32

    Google Scholar 

  14. Laguna M, Barnes JW, Glover F (1991) Tabu search methods for single machine scheduling problems. J Intellig Manufact 2:63–74

    Google Scholar 

  15. Armentano VA, Yamashita DS (2000) Tabu search for scheduling on identical parallel machines to minimize mean tardiness. J Intellig Manufact 11:453–460

    Article  Google Scholar 

  16. Crauwels HAJ, Potts CN, Wassenhove LNV (1996) Local search heuristics for the single machine scheduling with batching to minimize the number of late jobs. Eur J Oper Res 90:200–213

    Article  Google Scholar 

  17. Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220:671–680

    Google Scholar 

  18. Uzsoy R (1998) Parallel machine problems. machine scheduling problem data sets. http://palette.ecn.purdue.edu/~uzsoy2/Problems/parallel/parameters.html. Cited 3 April 1998

Download references

Author information

Authors and Affiliations

  1. School of Computer Science and Industrial Engineering, Yonsei University, 120-749, Seoul, Republic of Korea

    Chang Ouk Kim

  2. Dept of Industrial Engineering, Texas A&M University, College Station, Texas, 77343-3367 (117H), USA

    Hyun Joon Shin

Authors
  1. Chang Ouk Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hyun Joon Shin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hyun Joon Shin.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kim, C.O., Shin, H.J. Scheduling jobs on parallel machines: a restricted tabu search approach. Int J Adv Manuf Technol 22, 278–287 (2003). https://doi.org/10.1007/s00170-002-1472-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-002-1472-2

Keywords

Search

Navigation