Abstract
The job shop scheduling problem is considered, and an algorithm based on the global equilibrium search method is proposed for its solution. Computational experiments using well-known benchmark problems are presented. Several new upper bounds for these problems are obtained.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Applegate D, Cook W (1991) A computational study of the job-shop scheduling instance. ORSA J Comput 3:149–156
Balas E, Vazacopoulos A (1995a) Guided local search with shifting bottleneck for job shop scheduling. MSSRR 609, GSIA, Carnegie Mellon University, Pittsburgh
Balas E, Vazacopoulos A (1995b) Guided local search with shifting bottleneck for job shop scheduling. Manage Sci 44:262–275
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
Demirkkol E, Mehta S, Uzsloy R (1997) Benchmarks for job shop scheduling problems. Eur J Operat Res 109:137–141
Grabowski J, Nowicki E, Smutnicki C (1988) Block algorithm for scheduling of operations in job-shop system (polish) Przeglad Statystyczny 35:67–80
Jain A, Meeran S (1999) Deterministic job shop scheduling: past, present and future. Eur J Operat Res 113:390–434
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
Lawler EL, Lenstra J-K, Rinnooy KA (1982) Recent developments in deterministic sequencing and scheduling Reidel, Dordrecht pp 35–73
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.
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
Nowicki E, Smutnicki C (1996) A fast tabu search algorithm for the job-shop problem. Manage Sci 42(6):797–813
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
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
Roy B, Sussman B (1964) Les problemes d’ordonnancement avec contraintes disjonctives. Note DS9 bis, SEMA, Paris (in French)
Shylo V (1999) A global equilibrium search method (Russian). Kybernetika i Systemniy Analys 1:74–80
Taillard E (1993) Benchmarks for basic scheduling problems. Eur J Operat Res 64:278–285
Van Laarhoven P, Aarts E, Lenstra J (1992) Job shop scheduling by simulated annealing. Operat Res 40:113–125
Watson J, Howe A, Whitley L (2003) An analysis of iterated local search for job-shop scheduling. In: Fifth metaheuristics international Conference (MIC 2003)
Author information
Authors and Affiliations
Corresponding author
Additional information
Research partially supported by NSF and AirForce grants.
Rights and permissions
About this article
Cite this article
Pardalos, P.M., Shylo, O.V. An Algorithm for the Job Shop Scheduling Problem based on Global Equilibrium Search Techniques. CMS 3, 331–348 (2006). https://doi.org/10.1007/s10287-006-0023-y
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10287-006-0023-y