A revised simulated annealing algorithm for obtaining the minimum total tardiness in job shop scheduling problems
From MaRDI portal
Publication:3366367
Recommendations
- An efficient configuration generation mechanism to solve job shop scheduling problems by the simulated annealing algorithm
- Scheduling in flowshops to minimize total tardiness of jobs
- scientific article; zbMATH DE number 6263695
- A simulated annealing approach for the one-machine mean tardiness scheduling problem
- Some new results on simulated annealing applied to the job shop scheduling problem
Cited in
(10)- Artificial Intelligence and Soft Computing - ICAISC 2004
- Neighbourhood generation mechanism applied in simulated annealing to job shop scheduling problems
- A particle swarm optimization-based algorithm for job-shop scheduling problems
- Optimal and heuristic solutions for a scheduling problem arising in a foundry
- A general approach for optimizing regular criteria in the job-shop scheduling problem
- Enhancing local search algorithms for job shops with MIN-sum objectives by approximate move evaluation
- A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective
- Corrigendum to ``A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective
- scientific article; zbMATH DE number 6263695 (Why is no real title available?)
- A simulated annealing approach for the one-machine mean tardiness scheduling problem
This page was built for publication: A revised simulated annealing algorithm for obtaining the minimum total tardiness in job shop scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3366367)