Temporal linear relaxation in IBM ILOG CP optimizer

DOI10.1007/s10951-014-0408-7zbMath1347.90044OpenAlexW2052516771MaRDI QIDQ309055

Jérôme Rogerie, Philippe Laborie

Publication date: 7 September 2016

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-014-0408-7

zbMATH Keywords

linear programmingschedulingconstraint programmingirregular objective functions

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (8)

Constraint programming and operations research ⋮ IBM ILOG CP optimizer for scheduling. 20+ years of scheduling with constraints at IBM/ILOG ⋮ Packing by scheduling: using constraint programming to solve a complex 2D cutting stock problem ⋮ An algorithm selection approach for the flexible job shop scheduling problem: choosing constraint programming solvers through machine learning ⋮ Dial-a-ride problem: mixed integer programming revisited and constraint programming proposed ⋮ Unnamed Item ⋮ Patrolling security games: definition and algorithms for solving large instances with single patroller and single intruder ⋮ A computational study of constraint programming approaches for resource-constrained project scheduling with autonomous learning effects

Uses Software

• CP Optimizer

Cites Work

• Unnamed Item
• Preemption in single machine earliness/tardiness scheduling
• An integrated method for planning and scheduling to minimize tardiness
• A new tabu search procedure for an audit-scheduling problem
• Convex envelopes of monomials of odd degree
• A hybrid approach to scheduling with earliness and tardiness costs
• Lagrangian bounds for just-in-time job-shop scheduling
• Detecting infeasibility and generating cuts for mixed integer programming using constraint programming
• Scheduling Aircraft Landings—The Static Case
• A scatter search heuristic for maximising the net present value of a resource-constrained project with fixed activity cash flows
• Mixed Integer Programming vs. Logic-Based Benders Decomposition for Planning and Scheduling
• Column Generation
• Principles and Practice of Constraint Programming – CP 2004
• An exact procedure for the resource-constrained weighted earliness-tardiness project scheduling problem
• Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates

This page was built for publication: Temporal linear relaxation in IBM ILOG CP optimizer