A rollout metaheuristic for job shop scheduling problems
From MaRDI portal
Publication:702727
DOI10.1023/B:ANOR.0000039520.24932.4bzbMath1066.90035OpenAlexW2015465419MaRDI QIDQ702727
Dario Pacciarelli, Marco Pranzo, Carlo Meloni
Publication date: 17 January 2005
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:anor.0000039520.24932.4b
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Parallel-identical-machine job-shop scheduling with different stage-dependent buffering requirements ⋮ An efficient tabu search neighborhood based on reconstruction strategy to solve the blocking job shop scheduling problem ⋮ Metaheuristics for the multi-objective FJSP with sequence-dependent set-up times, auxiliary resources and machine down time ⋮ Evaluation of the quantiles and superquantiles of the makespan in interval valued activity networks ⋮ A rollout algorithm framework for heuristic solutions to finite-horizon stochastic dynamic programs ⋮ Efficient primal heuristic updates for the blocking job shop problem ⋮ A survey of scheduling problems with no-wait in process ⋮ No-wait job shop scheduling: tabu search and complexity of subproblems ⋮ A new neighborhood and tabu search for the blocking job shop ⋮ The flexible blocking job shop with transfer and set-up times ⋮ Dynamic programming and suboptimal control: a survey from ADP to MPC ⋮ The dispatching problem on multitrack territories: Heuristic approaches based on mixed integer linear programming ⋮ Hybrid rollout approaches for the job shop scheduling problem ⋮ Complete local search with limited memory algorithm for no-wait job shops to minimize makespan ⋮ Looking ahead with the pilot method
