Metaheuristics for minimizing the makespan of the dynamic shop scheduling problem

DOI10.1016/j.advengsoft.2004.10.002zbMath1066.90034MaRDI QIDQ1765745

Xianqiang Yang

Publication date: 23 February 2005

Published in: Advances in Engineering Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.advengsoft.2004.10.002

zbMATH Keywords

Metaheuristics; Makespan; Machine scheduling; Dynamic shop scheduling; Group-shop; Mixed-shop

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming