Corrigendum to ``A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective
DOI10.1016/J.COR.2013.04.013zbMATH Open1348.90336OpenAlexW1965687387MaRDI QIDQ336632FDOQ336632
Authors: Rui Zhang, J. Kuhpfahl 
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2013.04.013
Recommendations
- A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective
- A revised simulated annealing algorithm for obtaining the minimum total tardiness in job shop scheduling problems
- Corrigendum to: ``Solving the job-shop scheduling problem optimally by dynamic programming
- Some new results on simulated annealing applied to the job shop scheduling problem
- scientific article; zbMATH DE number 6263695
- Corrigendum to: ``Solving the flexible job shop scheduling problem with sequence-dependent setup times
- Two simulated annealing-based heuristics for the job shop scheduling problem
- An exchange heuristic imbedded with simulated annealing for due-dates job-shop scheduling
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
Cited In (1)
This page was built for publication: Corrigendum to ``A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336632)
