Algorithms for hybrid MILP/CP models for a class of optimization problems

DOI10.1287/IJOC.13.4.258.9733zbMATH Open1238.90106OpenAlexW2097731353MaRDI QIDQ2884510FDOQ2884510

Authors: Vipul Jain, Ignacio E. Grossmann 

Publication date: 30 May 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/e5705054e08238044833e29c30b015e35270e605

Recommendations

• Decomposition techniques for hybrid MILP/CP models applied to scheduling and routing 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
• Hybrid MIP-CP techniques to solve a multi-machine assignment and scheduling problem in Xpress-CP

zbMATH Keywords

integer programminghybrid algorithmsparallel machine scheduling

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Mixed integer programming (90C11)

Cited In (75)

• Data-driven feasibility analysis for the integration of planning and scheduling problems
• Optimal decomposition approach for solving large nesting and scheduling problems of additive manufacturing systems
• Nutmeg: a MIP and CP hybrid solver using branch-and-check
• Hybrid MIP-CP techniques to solve a multi-machine assignment and scheduling problem in Xpress-CP
• A fast and accurate technique for mapping parallel applications on stream-oriented MPSoC platforms with communication awareness
• Des explications pour reconnaître et exploiter les structures cachées d'un problème combinatoire
• Robust scheduling with logic-based Benders decomposition
• Mixed-Integer Programming vs. Constraint Programming for Shop Scheduling Problems: New Results and Outlook
• Title not available (Why is that?)
• Scheduling of jobs on dissimilar parallel machine using computational intelligence algorithms
• Exact algorithms for a parallel machine scheduling problem with workforce and contiguity constraints
• MILP-Formulations for the Total Adjustment Cost Problem
• Balancing and scheduling of flexible mixed model assembly lines
• Multi-stage Benders Decomposition for Optimizing Multicore Architectures
• Optimal resource allocation and scheduling for the CELL BE platform
• Constraint programming and operations research
• A branch-and-price algorithm to solve the molten iron allocation problem in iron and steel industry
• Parallel machine scheduling with time constraints on machine qualifications
• Scheduling internal audit activities: a stochastic combinatorial optimization problem
• Principles and Practice of Constraint Programming – CP 2004
• On the separability of subproblems in Benders decompositions
• The Benders decomposition algorithm: a literature review
• Integer-programming software systems
• Decomposition techniques for hybrid MILP/CP models applied to scheduling and routing problems
• Mixed integer linear programming models for combinatorial optimization problems
• A hybrid method for the planning and scheduling
• Single-facility scheduling by logic-based Benders decomposition
• Changeover formulations for discrete-time mixed-integer programming scheduling models
• Challenges in Enterprise Wide Optimization for the Process Industries
• Solving planning and scheduling problems with combined integer and constraint programming
• A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates
• Petroleum refinery optimization
• Operating room scheduling with generalized disjunctive programming
• Polylithic modeling and solution approaches using algebraic modeling systems
• Finding reliable solutions: event-driven probabilistic constraint programming
• Using logic-based Benders decomposition to solve the capacity- and distance-constrained plant location problem
• Optimal solutions for a dock assignment problem with trailer transportation
• New lower bounds based on column generation and constraint programming for the pattern minimization problem
• Cutting plane algorithms for solving a stochastic edge-partition problem
• An integrated method for planning and scheduling to minimize tardiness
• Analysis of a parallel machine scheduling problem with sequence dependent setup times and job availability intervals
• Solving constrained optimization problems by solution-based decomposition search
• A cutting plane approach for integrated planning and scheduling
• Constraint Integer Programming: A New Approach to Integrate CP and MIP
• Combinatorial Benders' cuts for the strip packing problem
• Reconsidering mixed integer programming and MIP-based hybrids for scheduling
• Logic-based MultiObjective Optimization for Restoration Planning
• Scheduling inspired models for two-dimensional packing problems
• The stop-and-drop problem in nonprofit food distribution networks
• Solving a large-scale precedence constrained scheduling problem with elastic jobs using tabu search
• Local search and constraint programming for the post enrolment-based course timetabling problem
• Shop scheduling in manufacturing environments: a review
• A bilevel decomposition algorithm for simultaneous production scheduling and conflict-free routing for automated guided vehicles
• SCIP: solving constraint integer programs
• Optimizing the supply chain configuration for make-to-order manufacturing
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• A Benders approach for the constrained minimum break problem
• A hybrid approach to scheduling with earliness and tardiness costs
• Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags
• Integrating operations research in constraint programming
• Orbital Shrinking: A New Tool for Hybrid MIP/CP Methods
• Identifying and exploiting problem structures using explanation-based constraint programming
• Stochastic allocation and scheduling for conditional task graphs in multi-processor systems-on-chip
• Recursive logic-based Benders' decomposition for multi-mode outpatient scheduling
• A hybrid method for modeling and solving supply chain optimization problems with soft and logical constraints
• Detecting infeasibility and generating cuts for mixed integer programming using constraint programming
• Scheduling projects with multi-skilled personnel by a hybrid MILP/CP Benders decomposition algorithm
• Hybrid modeling
• Integrating operations research in constraint programming
• Benders' cuts guided large neighborhood search for the traveling umpire problem
• Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines
• Integrated production and material handling scheduling using mathematical programming and constraint programming
• Scheduling and routing of automated guided vehicles: A hybrid approach
• A new Lagrangian relaxation algorithm for scheduling dissimilar parallel machines with release dates
• A conflict-directed approach to chance-constrained mixed logical linear programming

This page was built for publication: Algorithms for hybrid MILP/CP models for a class of optimization problems

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