A Column Generation Model for a Scheduling Problem with Maintenance Constraints

DOI10.1016/S1571-0653(04)00001-0zbMath1130.90329OpenAlexW2050406094MaRDI QIDQ2741258

Maria Lebbar, Eric Jacquet-Lagrèze

Publication date: 23 September 2001

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s1571-0653(04)00001-0

Mathematics Subject Classification ID

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

Uses Software

• CHIP
• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• An additive bounding procedure for the asymmetric travelling salesman problem
• Towards a closer integration of finite domain propagation and simplex-based algorithms
• Constraint-based scheduling: Applying constraint programming to scheduling problems.
• Introducing global constraints in CHIP
• Solving various weighted matching problems with constraints
• An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows
• An Algorithm for Solving the Job-Shop Problem
• An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs
• A Polyhedral Approach to the Asymmetric Traveling Salesman Problem
• Solving large combinatorial problems in logic programming

This page was built for publication: A Column Generation Model for a Scheduling Problem with Maintenance Constraints