A revised simulated annealing algorithm for obtaining the minimum total tardiness in job shop scheduling problems
From MaRDI portal
Publication:3366367
DOI10.1080/002077200291118zbMath1080.93631OpenAlexW2126966447MaRDI QIDQ3366367
Publication date: 14 February 2006
Published in: International Journal of Systems Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/002077200291118
Related Items (6)
A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective ⋮ 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 ⋮ A PARTICLE SWARM OPTIMIZATION-BASED ALGORITHM FOR JOB-SHOP SCHEDULING PROBLEMS ⋮ Optimal and heuristic solutions for a scheduling problem arising in a foundry ⋮ Neighbourhood generation mechanism applied in simulated annealing to job shop scheduling problems
This page was built for publication: A revised simulated annealing algorithm for obtaining the minimum total tardiness in job shop scheduling problems
