Temporal linear relaxation in IBM ILOG CP optimizer

DOI10.1007/S10951-014-0408-7MaRDI QIDQ309055zbMATH OpenOpenAlexFDO

Authors Philippe Laborie, Jérôme Rogerie

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 programmingconstraint programmingschedulingirregular 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)

Recommendations

• Time optimization of linear program sections
• IBM ILOG CP optimizer for scheduling. 20+ years of scheduling with constraints at IBM/ILOG
• Temporal Parallelization of Dynamic Programming and Linear Quadratic Control
• Relaxation Methods for Linear Programs
• scientific article; zbMATH DE number 5669891
• Relaxation on Optimization Predicates
• scientific article; zbMATH DE number 2159468
• scientific article; zbMATH DE number 4172286
• A hybrid LP/NLP paradigm for global optimization relaxations

Cites work

• scientific article; zbMATH DE number 2080319 (Why is no real title available?)
• A hybrid approach to scheduling with earliness and tardiness costs
• A new tabu search procedure for an audit-scheduling problem
• A scatter search heuristic for maximising the net present value of a resource-constrained project with fixed activity cash flows
• An exact procedure for the resource-constrained weighted earliness-tardiness project scheduling problem
• An integrated method for planning and scheduling to minimize tardiness
• Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates
• Column Generation
• Convex envelopes of monomials of odd degree
• Detecting infeasibility and generating cuts for mixed integer programming using constraint programming
• Lagrangian bounds for just-in-time job-shop scheduling
• Mixed integer programming versus logic-based Benders decomposition for planning and scheduling
• Preemption in single machine earliness/tardiness scheduling
• Principles and Practice of Constraint Programming – CP 2004
• Scheduling aircraft landings -- the static case

Cited in

(9)

• Constraint programming and operations research
• A computational study of constraint programming approaches for resource-constrained project scheduling with autonomous learning effects
• Dial-a-ride problem: mixed integer programming revisited and constraint programming proposed
• scientific article; zbMATH DE number 7453120 (Why is no real title available?)
• Packing by scheduling: using constraint programming to solve a complex 2D cutting stock problem
• Patrolling security games: definition and algorithms for solving large instances with single patroller and single intruder
• IBM ILOG CP optimizer for scheduling. 20+ years of scheduling with constraints at IBM/ILOG
• An algorithm selection approach for the flexible job shop scheduling problem: choosing constraint programming solvers through machine learning
• Interval-based language for modeling scheduling problems: an extension to constraint programming

Describes a project that uses

Uses Software

• CP Optimizer

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

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