Metaheuristics for minimizing the makespan of the dynamic shop scheduling problem

DOI10.1016/j.advengsoft.2004.10.002zbMath1066.90034OpenAlexW2012754152MaRDI 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

MetaheuristicsMakespanMachine schedulingDynamic shop schedulingGroup-shopMixed-shop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (9)

Dynamic job shop scheduling using variable neighbourhood search ⋮ A hybrid metaheuristic algorithm to optimise a real-world robotic cell ⋮ Parallel-identical-machine job-shop scheduling with different stage-dependent buffering requirements ⋮ Real-time production scheduling in the Industry-4.0 context: addressing uncertainties in job arrivals and machine breakdowns ⋮ A real-world mine excavators timetabling methodology in open-pit mining ⋮ Dynamic shop-floor scheduling using real-time information: a case study from the thermoplastic industry ⋮ A generic deadlock-free reactive scheduling approach ⋮ Scheduling trains as a blocking parallel-machine job shop scheduling problem ⋮ Analysis of reactive deadlock-free scheduling in flexible job shops

This page was built for publication: Metaheuristics for minimizing the makespan of the dynamic shop scheduling problem