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

DOI10.1080/002077200291118MaRDI QIDQ3366367zbMATH OpenOpenAlexFDO

Authors Tai-Yue Wang, Kuei-Bin Wu

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

Mathematics Subject Classification ID

Systems theory; control (93-XX)

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

(11)

• Optimal and heuristic solutions for a scheduling problem arising in a foundry
• A simulated annealing approach for the one-machine mean tardiness scheduling problem
• 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
• A particle swarm optimization-based algorithm for job-shop scheduling problems
• Artificial Intelligence and Soft Computing - ICAISC 2004
• 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 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
• Scheduling for two stages with a single machine and a job shop

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)