scientific article; zbMATH DE number 1301968

MaRDI QIDQ4247203zbMATH OpenFDO

Authors K. Steinhöfel, C. K. Wong, Andreas Albrecht

Publication date 16 June 1999

zbMATH Keywords

job shop schedulingmakespansimulated annealing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Two simulated annealing-based heuristics for the job shop scheduling problem
• Job Shop Scheduling by Simulated Annealing
• Some new results on simulated annealing applied to the job shop scheduling problem
• scientific article; zbMATH DE number 1507222

Cited in

(7)

• An experimental analysis of local minima to improve neighbourhood search.
• The convergence of stochastic algorithms solving flow shop scheduling
• Two simulated annealing-based heuristics for the job shop scheduling problem
• Job Shop Scheduling by Simulated Annealing
• scientific article; zbMATH DE number 1507222 (Why is no real title available?)
• Artificial Intelligence and Soft Computing - ICAISC 2004
• Fast parallel heuristics for the job shop scheduling problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4247203)