A hybrid method for the planning and scheduling
From MaRDI portal
Publication:850451
DOI10.1007/s10601-005-2812-2zbMath1122.90054OpenAlexW2045994923MaRDI QIDQ850451
Publication date: 3 November 2006
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://figshare.com/articles/journal_contribution/A_Hybrid_Method_for_Planning_and_Scheduling/6703013
Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Constraint programming and operations research, A hybrid constraint programming approach to a wood procurement problem with bucking decisions, Petroleum refinery optimization, An integrated method for planning and scheduling to minimize tardiness, A two-stage coupled algorithm for an integrated maintenance planning and flowshop scheduling problem with deteriorating machines, Single-facility scheduling by logic-based Benders decomposition, A decomposition approach for solving a broadcast domination network design problem, A job-shop scheduling approach for optimising sugarcane rail operations, Scheduling of Jobs on Dissimilar Parallel Machine Using Computational Intelligence Algorithms, Logic-Based Benders Decomposition for Large-Scale Optimization, Scheduling of Tests on Vehicle Prototypes Using Constraint and Integer Programming, Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines, The Benders decomposition algorithm: a literature review, A hybrid constraint programming approach to the log-truck scheduling problem, Stochastic allocation and scheduling for conditional task graphs in multi-processor systems-on-chip, A constraint programming primer, Matheuristic for the decentralized factories scheduling problem, Decomposition Methods for the Parallel Machine Scheduling Problem with Setups, Solving an integrated employee timetabling and job-shop scheduling problem via hybrid branch-and-bound, Solving integrated process planning, dynamic scheduling, and due date assignment using metaheuristic algorithms, Solving an integrated job-shop problem with human resource constraints, Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem, Logic-based MultiObjective Optimization for Restoration Planning, Cut generation for an integrated employee timetabling and production scheduling problem
Cites Work
- Partitioning procedures for solving mixed-variables programming problems
- Logic-based Benders decomposition
- Constraint-based scheduling: Applying constraint programming to scheduling problems.
- Generalized Benders decomposition
- Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
- Principles and Practice of Constraint Programming – CP 2004
- Principles and Practice of Constraint Programming – CP 2004
- Unnamed Item
- Unnamed Item
- Unnamed Item
