An efficient configuration generation mechanism to solve job shop scheduling problems by the simulated annealing algorithm
From MaRDI portal
Publication:4546893
DOI10.1080/002077299292263zbMath1049.90511MaRDI QIDQ4546893
Publication date: 1999
Published in: International Journal of Systems Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/002077299292263
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
Related Items
Enhancing local search algorithms for job shops with MIN-sum objectives by approximate move evaluation, A general approach for optimizing regular criteria in the job-shop scheduling problem, Neighbourhood generation mechanism applied in simulated annealing to job shop scheduling problems