Dynamic job shop scheduling using variable neighbourhood search

DOI10.1080/00207540802662896zbMath1197.90241OpenAlexW2154155503MaRDI QIDQ3163356

M. A. Adibi, Mostafa Zandieh

Publication date: 25 October 2010

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540802662896

zbMATH Keywords

artificial neural networksvariable neighbourhood searchdynamic job shop scheduling

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Deterministic scheduling theory in operations research (90B35)

Related Items (6)

Dynamic resource allocation and collaborative scheduling in R\&D and manufacturing processes of high-end equipment with budget constraint ⋮ Ant colony algorithm for just-in-time job shop scheduling with transportation times and multirobots ⋮ Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs ⋮ Variable neighbourhood search and mathematical programming for just-in-time job-shop scheduling problem ⋮ Optimal computing budget allocation for ordinal optimization in solving stochastic job shop scheduling problems ⋮ Solving integrated process planning, dynamic scheduling, and due date assignment using metaheuristic algorithms

Cites Work

• Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem
• Variable neighborhood search
• Variable neighborhood tabu search and its application to the median cycle problem.
• Metaheuristics for minimizing the makespan of the dynamic shop scheduling problem
• Dynamic scheduling selection of dispatching rules for manufacturing system
• Reactive scheduling in a dynamic and stochastic FMS environment

This page was built for publication: Dynamic job shop scheduling using variable neighbourhood search