Improving branch and bound for jobshop scheduling with constraint propagation

DOI10.1007/3-540-61576-8_79MaRDI QIDQ6567676zbMATH OpenFDO

Authors Yves Caseau, François Laburthe

Publication date 5 July 2024

zbMATH Keywords

heuristicsconstraintspropagationbranch-and-boundjobshop scheduling

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Recommendations

• A branch and bound algorithm for the job-shop scheduling problem
• Constraint Propagation Based Scheduling of Job Shops
• scientific article; zbMATH DE number 1487903
• A new approach to computing optimal schedules for the job-shop scheduling problem
• Constraint propagation techniques for the disjunctive scheduling problem

Cites work

• scientific article; zbMATH DE number 49601 (Why is no real title available?)
• A Computational Study of the Job-Shop Scheduling Problem
• Adjustment of heads and tails for the job-shop problem
• An Algorithm for Solving the Job-Shop Problem
• Applying tabu search to the job-shop scheduling problem
• Formulating the single machine sequencing problem with release dates as a mixed integer program
• Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
• On the facial structure of scheduling polyhedra
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• The one-machine sequencing problem

This page was built for publication: Improving branch and bound for jobshop scheduling with constraint propagation

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