An algorithm for the job shop scheduling problem based on global equilibrium search techniques

Computational Management Science

Volumn 3, Issue 4, 2006, Pages 331-348

  Pardalos, Panos M ^a   Shylo, Oleg V ^a  

^a UNIVERSITY OF FLORIDA   (United States)

Author keywords

Global equilibrium search; Job shop scheduling problem; Makespan; Metaheuristics

Indexed keywords

EID: 33747652903     PISSN: 1619697X     EISSN: 16196988     Source Type: Journal    
DOI: 10.1007/s10287-006-0023-y     Document Type: Article

References (19)

1. Applegate D, Cook W (1991) A computational study of the job-shop scheduling instance. ORSA J Comput 3:149-156
2. Balas E, Vazacopoulos A (1995a) Guided local search with shifting bottleneck for job shop scheduling. MSSRR 609, GSIA, Carnegie Mellon University, Pittsburgh
3. Balas E, Vazacopoulos A (1995b) Guided local search with shifting bottleneck for job shop scheduling. Manage Sci 44:262-275
4. Binato S, Hery W, Loewenstern D, Resende M (2001) A GRASP for job shop scheduling, Essays and surveys on metaheuristics. Kluwer, Dordrecht, pp 59-79
5. Demirkkol E, Mehta S, Uzsloy R (1997) Benchmarks for job shop scheduling problems. Eur J Operat Res 109:137-141
6. Grabowski J, Nowicki E, Smutnicki C (1988) Block algorithm for scheduling of operations in job-shop system (polish) Przeglad Statystyczny 35:67-80
7. Jain A, Meeran S (1999) Deterministic job shop scheduling: Past, present and future. Eur J Operat Res 113:390-434
8. Jain A, Rangaswamy B, Meeran S (2000) New and stronger job shop neighborshoods: A focus on the method of nowicki and smutnicki (1996). J Heurist 6(4):457-480
9. Lawler EL, Lenstra J-K, Rinnooy KA (1982) Recent developments in deterministic sequencing and scheduling Reidel, Dordrecht pp 35-73
10. Lawrence S (1984) Resource constrained project scheduling: An experimental investigation of heuristic scheduling techniques (supplement). Graduate School of Industrial Administration Carnegie-Mellon University, Pittsburgh, Pennsylvania.
11. Lee C-Y, Pinedo M (2002) Optimization and heuristic scheduling. In: Pardalos PM, Resende MGC (eds) Handbook of Applied Optimization. Oxford University Press, Oxford, pp 569-584
12. Nowicki E, Smutnicki C (1996) A fast tabu search algorithm for the job-shop problem. Manage Sci 42(6):797-813
13. Nowicki E, Smutnicki C (2002) Some new tools to solve the job shop problem. Technical report 60/2002, Institute of Engineering Cybernetics, Technical University of Wroclaw, Wroclaw, Poland
14. Pezzella F, Merelli E (2000) A tabu search method guided by shifting bottleneck for the job shop scheduling problem. Eur J Operat Res 120:297-310
15. Roy B, Sussman B (1964) Les problemes d'ordonnancement avec contraintes disjonctives. Note DS9 bis, SEMA, Paris (in French)
16. Shylo V (1999) A global equilibrium search method (Russian). Kybernetika i Systemniy Analys 1:74-80
17. Taillard E (1993) Benchmarks for basic scheduling problems. Eur J Operat Res 64:278-285
18. Van Laarhoven P, Aarts E, Lenstra J (1992) Job shop scheduling by simulated annealing. Operat Res 40:113-125
19. Watson J, Howe A, Whitley L (2003) An analysis of iterated local search for job-shop scheduling. In: Fifth metaheuristics international Conference (MIC 2003)