Hybrid MIP-CP techniques to solve a multi-machine assignment and scheduling problem in Xpress-CP

MaRDI QIDQ5481000zbMATH OpenFDO

Authors Nitin Verma, Alkis Vazacopoulos

Publication date 7 August 2006

zbMATH Keywords

assignmentscheduling problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Mixed integer programming (90C11) Discrete location and assignment (90B80)

Recommendations

• Integer programming and constraint programming in solving a multimachine assignment scheduling problem with deadlines and release dates
• Algorithms for hybrid MILP/CP models for a class of optimization problems
• Reconsidering mixed integer programming and MIP-based hybrids for scheduling
• Principles and Practice of Constraint Programming – CP 2004
• A hybrid method for the planning and scheduling

Cited in

(4)

• Integer programming and constraint programming in solving a multimachine assignment scheduling problem with deadlines and release dates
• Algorithms for hybrid MILP/CP models for a class of optimization problems
• Runway sequencing with holding patterns
• A comparative study of MIP and CP formulations for the B2B scheduling optimization problem

Describes a project that uses

Uses Software

• Mosel
• XPRESS

This page was built for publication: Hybrid MIP-CP techniques to solve a multi-machine assignment and scheduling problem in Xpress-CP

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