Neighbourhood generation mechanism applied in simulated annealing to job shop scheduling problems
From MaRDI portal
Publication:2792203
DOI10.1080/00207721.2013.876679zbMath1332.90119OpenAlexW1999512942MaRDI QIDQ2792203
Publication date: 8 March 2016
Published in: International Journal of Systems Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207721.2013.876679
Cites Work
- Unnamed Item
- A general approach for optimizing regular criteria in the job-shop scheduling problem
- Ant colony optimization combined with taboo search for the job shop scheduling problem
- An experimental analysis of local minima to improve neighbourhood search.
- Some new results on simulated annealing applied to the job shop scheduling problem
- A very fast TS/SA algorithm for the job shop scheduling problem
- A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems
- A hybrid genetic algorithm for the job shop scheduling problem
- Minimising makespan for two batch-processing machines with non-identical job sizes in job shop
- A revised simulated annealing algorithm for obtaining the minimum total tardiness in job shop scheduling problems
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- Job Shop Scheduling by Simulated Annealing
- A Computational Study of the Job-Shop Scheduling Problem
- An efficient configuration generation mechanism to solve job shop scheduling problems by the simulated annealing algorithm
- Stochastic algorithms: Foundations and applications. International symposium, SAGA 2001, Berlin, Germany, December 13--14, 2001. Proceedings