Solving the open shop scheduling problem

DOI10.1002/jos.73zbMath0991.90068OpenAlexW2164950451MaRDI QIDQ5939272

Toàn Phan-Huy, Erwin Pesch, Ulrich Dorndorf

Publication date: 27 August 2001

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jos.73

zbMATH Keywords

branch-and-boundconstraint propagation

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Related Items (18)

Constraint programming and operations research ⋮ 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 novel complex network based dynamic rule selection approach for open shop scheduling problem with release dates ⋮ Arc-B-consistency of the inter-distance constraint ⋮ Computing relaxations for the three-dimensional stable matching problem with cyclic preferences ⋮ Partially concurrent open shop scheduling with integral preemptions ⋮ Open-shop dense schedules: properties and worst-case performance ratio ⋮ 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 ⋮ Heuristic constructive algorithms for open shop scheduling to minimize mean flow time ⋮ Scheduling and constraint propagation ⋮ The museum visitor routing problem ⋮ Dynamic programming approach for solving the open shop problem ⋮ A contribution and new heuristics for open shop scheduling ⋮ An Optimal Constraint Programming Approach to the Open-Shop Problem ⋮ Performance analysis of rotation schedule and improved strategy for open shop problem to minimise makespan

Cites Work

• Unnamed Item
• Unnamed Item
• The generalized shifting bottleneck procedure
• Classical and new heuristics for the open-shop problem: A computational evaluation
• Constructive heuristic algorithms for the open shop problem
• A branch and bound algorithm for the job-shop scheduling problem
• The job-shop problem and immediate selection
• Adjustment of heads and tails for the job-shop problem
• A branch \(\&\) bound algorithm for the open-shop problem
• Competitive genetic algorithms for the open-shop scheduling problem
• Constraint propagation in flexible manufacturing
• Constraint propagation techniques for the disjunctive scheduling problem
• Insertion techniques for the heuristic solution of the job shop problem
• An iterative improvement approach for the nonpreemptive open shop scheduling problem
• A new lower bound for the open-shop problem
• Benchmarks for basic scheduling problems
• An Algorithm for Solving the Job-Shop Problem
• A Computational Study of the Job-Shop Scheduling Problem

This page was built for publication: Solving the open shop scheduling problem