Skip to main content
SpringerLink
Log in

A priority list based heuristic for the job shop problem: part 2 tabu search

  • Technical Note
  • Published:
Journal of the Operational Research Society

Abstract

Following a recent paper by the same author, a priority list-based tabu search heuristic is compared with the leading schedule-based tabu search heuristic of Nowicki and Smutnicki. More search neighbourhoods are required to achieve a given average makespan, but each priority list neighbourhood is searched much faster than the corresponding neighbourhood in the space of feasible schedules. Priority list-based tabu search therefore outperforms schedule-based tabu search in terms of elapsed CPU time.

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

Figure 1
Figure 2
Figure 3
Figure 4
Figure 5
Figure 6

Similar content being viewed by others

References

  • Shutler PME (2003). A priority list based heuristic for the job shop problem. J Opl Res Soc 54: 571–584.

    Article  Google Scholar 

  • van Laarhoven PJM, Aarts EHL and Lenstra JK (1992). Job shop scheduling by simulated annealing. Opns Res 40: 113–125.

    Article  Google Scholar 

  • Nowicki E and Smutnicki C (1996). A fast taboo search algorithm for the job shop problem. Mgmt Sci 42: 797–813.

    Article  Google Scholar 

  • Golenko-Ginzburg D and Sims JA (1992). Using permutation spaces in job-shop scheduling. Asia Pacific J Opl Res 9: 183–193.

    Google Scholar 

  • Bellman RE (1958). On a routing problem. Quart Appl Math 16: 87–90.

    Article  Google Scholar 

  • Taillard ED (1994). Parallel taboo search techniques for the job shop scheduling problem. ORSA J Comput 6: 108–117.

    Article  Google Scholar 

  • Lawrence S (1984). Resource constrained scheduling: an experimental investigation of heuristic scheduling techniques (Supplement), Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh.

  • Vaessens RJM, Aarts EHL and Lenstra JK (1996). Job shop scheduling by local search. INFORMS J Comput 8: 302–317.

    Article  Google Scholar 

  • Taillard E (1993). Benchmarks for basic scheduling problems. Eur J Opl Res 64: 278–285.

    Article  Google Scholar 

  • Taillard E (2002). http://www.eivd.ch/ina/collaborateurs/etd/default.htm.

Download references

Author information

Authors and Affiliations

  1. Nanyang Technological University, Singapore

    Paul M E Shutler

Authors
  1. Paul M E Shutler
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Paul M E Shutler.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shutler, P. A priority list based heuristic for the job shop problem: part 2 tabu search. J Oper Res Soc 55, 780–784 (2004). https://doi.org/10.1057/palgrave.jors.2601757

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1057/palgrave.jors.2601757

Keywords

Search

Navigation