Enhancing CLP branch and bound techniques for scheduling problems

DOI<17::AID-SPE355>3.0.CO;2-L 10.1002/1097-024X(200101)31:1<17::AID-SPE355>3.0.CO;2-LzbMath0963.68664OpenAlexW2069682444MaRDI QIDQ2721220

No author found.

Publication date: 1 July 2001

Full work available at URL: https://doi.org/10.1002/1097-024x(200101)31:1<17::aid-spe355>3.0.co;2-l

zbMATH Keywords

scheduling problemshybrid solverintegration of OR techniques in CLP

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Logic programming (68N17)

Related Items (1)

Scheduling trainees at a hospital department using a branch-and-price approach

Cites Work

• Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
• Constraint-based job shop scheduling with Ilog Scheduler
• Introducing global constraints in CHIP
• Solving TSP through the Integration of OR and CP Techniques
• An example of integrating constraint programming and mathematical programming
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• Solving Airline Crew Scheduling Problems by Branch-and-Cut
• Solving large combinatorial problems in logic programming
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Enhancing CLP branch and bound techniques for scheduling problems