A tabu search algorithm for the open shop scheduling problem
From MaRDI portal
Publication:1302574
DOI10.1016/S0305-0548(98)00056-2zbMath0947.90048OpenAlexW1971434457MaRDI QIDQ1302574
Publication date: 22 September 1999
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(98)00056-2
Related Items (17)
A new particle swarm optimization for multi-objective open shop scheduling ⋮ New efficient heuristics for scheduling open shops with makespan minimization ⋮ An effective heuristic algorithm for the partial shop scheduling problem ⋮ Unnamed Item ⋮ A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times ⋮ A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions ⋮ A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan ⋮ A tabu search approach for proportionate multiprocessor open shop scheduling ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ METAHEURISTICS FOR THE MIXED SHOP SCHEDULING PROBLEM ⋮ A new particle swarm optimization for the open shop scheduling problem ⋮ The museum visitor routing problem ⋮ A tabu search algorithm for parallel machine total tardiness problem ⋮ Finding the shortest path with honey-bee mating optimization algorithm in project management problems with constrained/unconstrained resources ⋮ SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM ⋮ A hybrid genetic algorithm for the open shop scheduling problem ⋮ Local search with constraint propagation and conflict-based heuristics
This page was built for publication: A tabu search algorithm for the open shop scheduling problem
