Classical and new heuristics for the open-shop problem: A computational evaluation

DOI10.1016/S0377-2217(97)00332-9zbMath0943.90029MaRDI QIDQ1296088

Christian Prins, Christelle Guéret

Publication date: 13 September 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

heuristicsbipartite graphlocal searchmatchingsopen-shopminimum makespan schedules

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (20)

Scheduling two-machine preemptive open shops to minimize total completion time ⋮ New efficient heuristics for scheduling open shops with makespan minimization ⋮ Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop ⋮ An effective heuristic algorithm for the partial shop scheduling problem ⋮ A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions ⋮ A constraint programming-based iterated greedy algorithm for the open shop with sequence-dependent processing times and makespan minimization ⋮ A review on integrated scheduling and outbound vehicle routing problems ⋮ An efficient tabu search approach for the two-machine preemptive open shop scheduling problem. ⋮ 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 new particle swarm optimization for the open shop scheduling problem ⋮ The museum visitor routing problem ⋮ Solving the open shop scheduling problem ⋮ A contribution and new heuristics for open shop scheduling ⋮ SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM ⋮ A hybrid genetic algorithm for the open shop scheduling problem ⋮ A genetic algorithm for scheduling open shops with sequence-dependent setup times ⋮ Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems ⋮ The total completion time open shop scheduling problem with a given sequence of jobs on one machine ⋮ Open shop scheduling problems with conflict graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Balanced optimization problems
• Constructive heuristic algorithms for the open shop problem
• A branch \(\&\) bound algorithm for the open-shop problem
• Benchmarks for basic scheduling problems
• Open Shop Scheduling to Minimize Finish Time

This page was built for publication: Classical and new heuristics for the open-shop problem: A computational evaluation