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

Journal of the Operational Research Society

Volumn 55, Issue 7, 2004, Pages 780-784

  Shutler, Paul M E ^a,b  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^b NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

Heuristics; Job shop problem; Priority lists; Scheduling; Tabu search

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; MONTE CARLO METHODS; OPERATIONS RESEARCH; PROBLEM SOLVING; SCHEDULING; SIMULATED ANNEALING;

HEURISTICS; JOB SHOP PROBLEM; PRIORITY LISTS; TABU SEARCH;

HEURISTIC METHODS;

EID: 3042835533     PISSN: 01605682     EISSN: None     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601757     Document Type: Conference Paper

References (10)

1. Shutler PME (2003). A priority list based heuristic for the job shop problem. J Opl Res Soc 54: 571-584.
2. van Laarhoven PJM, Aarts EHL and Lenstra JK (1992). Job shop scheduling by simulated annealing. Opns Res 40: 113-125.
3. Nowicki E and Smutnicki C (1996). A fast taboo search algorithm for the job shop problem. Mgmt Sci 42: 797-813.
4. Golenko-Ginzburg D and Sims JA (1992). Using permutation spaces in job-shop scheduling. Asia Pacific J Opl Res 9: 183-193.
5. Bellman RE (1958). On a routing problem. Quart Appl Math 16: 87-90.
6. Taillard ED (1994). Parallel taboo search techniques for the job shop scheduling problem. ORSA J Comput 6: 108-117.
7. Lawrence S (1984). Resource constrained scheduling: an experimental investigation of heuristic scheduling techniques (Supplement), Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh.
8. Vaessens RJM, Aarts EHL and Lenstra JK (1996). Job shop scheduling by local search. INFORMS J Comput 8: 302-317.
9. Taillard E (1993). Benchmarks for basic scheduling problems. Eur J Opl Res 64: 278-285.
10. Taillard E (2002). http://www.eivd.ch/ina/collaborateurs/etd/default.htm.