Improving branch and bound for jobshop scheduling with constraint propagation

DOI10.1007/3-540-61576-8_79zbMATH Open1543.90086MaRDI QIDQ6567676FDOQ6567676

Authors: Yves Caseau, François Laburthe 

Publication date: 5 July 2024

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

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)

Cites Work

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

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)