A fast tabu search algorithm for the group shop scheduling problem
From MaRDI portal
Publication:2485226
DOI10.1016/j.advengsoft.2005.02.002zbMath1101.68422OpenAlexW1965450496MaRDI QIDQ2485226
Publication date: 3 August 2005
Published in: Advances in Engineering Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.advengsoft.2005.02.002
Searching and sorting (68P10) Nonnumerical algorithms (68W05) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
Group-shop scheduling with sequence-dependent set-up and transportation times ⋮ A hybrid metaheuristic algorithm to optimise a real-world robotic cell ⋮ An effective heuristic algorithm for the partial shop scheduling problem ⋮ Parallel-identical-machine job-shop scheduling with different stage-dependent buffering requirements ⋮ Optimising a coal rail network under capacity constraints ⋮ Solving scheduling problems from high-level models ⋮ Group shops scheduling with makespan criterion subject to random release dates and processing times ⋮ Scheduling trains as a blocking parallel-machine job shop scheduling problem