A tabu search algorithm for the open shop problem

DOI10.1007/BF02568554zbMath0892.90095MaRDI QIDQ1383321

Joaquín Sicilia, David Alcaide, Daniele Vigo

Publication date: 11 June 1998

Published in: Top (Search for Journal in Brave)

zbMATH Keywords

tabu searchsequencingarbitrary number of machinesminimum makespan open shop problem without preemption

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)

Related Items

Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop, Unnamed Item, A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times, A tabu search approach for proportionate multiprocessor open shop scheduling, OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises, Four decades of research on the open-shop scheduling problem to minimize the makespan, A heuristic approach to minimize expected makespan in open shops subject to stochastic processing times and failures, A new particle swarm optimization for the open shop scheduling problem, The museum visitor routing problem, A hybrid genetic algorithm for the open shop scheduling problem, Local search with constraint propagation and conflict-based heuristics

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Benchmarks for basic scheduling problems
• Applying tabu search to the job-shop scheduling problem
• Job Shop Scheduling by Simulated Annealing
• Tabu Search—Part I
• Tabu Search—Part II
• Open Shop Scheduling to Minimize Finish Time