Solving the open shop scheduling problem

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

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

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-bound; constraint propagation

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90B35: Deterministic scheduling theory in operations research

Related Items

Scheduling and constraint propagation, Arc-B-consistency of the inter-distance constraint, A new particle swarm optimization for the open shop scheduling problem, Heuristic constructive algorithms for open shop scheduling to minimize mean flow time

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