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

DOI10.1016/S0377-2217(97)00332-9MaRDI QIDQ1296088zbMATH OpenFDO

Authors Christelle Guéret, Christian Prins

Publication date 13 September 2000

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

Full work available at URL https://doi.org/10.1016/S0377-2217(97)00332-9

zbMATH Keywords

bipartite graphheuristicslocal searchmatchingsminimum makespan schedulesopen-shop

Mathematics Subject Classification ID

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

Recommendations

• Constructive heuristic algorithms for the open shop problem
• New efficient heuristics for scheduling open shops with makespan minimization
• Heuristic constructive algorithms for open shop scheduling to minimize mean flow time
• A contribution and new heuristics for open shop scheduling

Cites work

• A branch \(\&\) bound algorithm for the open-shop problem
• Balanced optimization problems
• Benchmarks for basic scheduling problems
• Constructive heuristic algorithms for the open shop problem
• scientific article; zbMATH DE number 3989126 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• Network flows. Theory, algorithms, and applications.
• Open Shop Scheduling to Minimize Finish Time

Cited in

(22)

• Constructive heuristic algorithms for the open shop problem
• An efficient tabu search approach for the two-machine preemptive open shop scheduling problem.
• A hybrid genetic algorithm for the open shop scheduling problem
• 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
• An effective heuristic algorithm for the partial shop scheduling problem
• Scheduling two-machine preemptive open shops to minimize total completion time
• New efficient heuristics for scheduling open shops with makespan minimization
• Four decades of research on the open-shop scheduling problem to minimize the makespan
• A genetic algorithm for scheduling open shops with sequence-dependent setup times
• Open shop scheduling problems with conflict graphs
• Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop
• A new particle swarm optimization for the open shop scheduling problem
• SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM
• OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises
• Solving the open 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
• The LPT heuristic for minimizing total load on a proportionate openshop
• A review on integrated scheduling and outbound vehicle routing problems
• A contribution and new heuristics for open shop scheduling
• The museum visitor routing problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296088)