A revised simulated annealing algorithm for obtaining the minimum total tardiness in job shop scheduling problems

DOI10.1080/002077200291118zbMATH Open1080.93631OpenAlexW2126966447MaRDI QIDQ3366367FDOQ3366367

Publication date: 14 February 2006

Published in: International Journal of Systems Science. Principles and Applications of Systems and Integration (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/002077200291118

Recommendations

Mathematics Subject Classification ID

Systems theory; control (93-XX)

Cited In (10)

Optimal and heuristic solutions for a scheduling problem arising in a foundry
A simulated annealing approach for the one-machine mean tardiness scheduling problem
Neighbourhood generation mechanism applied in simulated annealing to job shop scheduling problems
A particle swarm optimization-based algorithm for job-shop scheduling problems
A general approach for optimizing regular criteria in the job-shop scheduling problem
Artificial Intelligence and Soft Computing - ICAISC 2004
Title not available (Why is that?)
Corrigendum to ``A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective
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

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)