A hybrid method for the planning and scheduling

DOI10.1007/S10601-005-2812-2zbMATH Open1122.90054OpenAlexW2045994923MaRDI QIDQ850451FDOQ850451

Authors: John N. Hooker 

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

Recommendations

• Principles and Practice of Constraint Programming – CP 2004
• Planning and Scheduling by Logic-Based Benders Decomposition
• An integrated method for planning and scheduling to minimize tardiness
• Planning and Scheduling to Minimize Tardiness
• Algorithms for hybrid MILP/CP models for a class of optimization problems

zbMATH Keywords

hybrid methodsplanning and schedulingBender's decomposition

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Deterministic scheduling theory in operations research (90B35) Mixed integer programming (90C11)

Cites Work

• Partitioning procedures for solving mixed-variables programming problems
• Logic-based Benders decomposition
• Generalized Benders decomposition
• Constraint-based scheduling: Applying constraint programming to scheduling problems.
• Title not available (Why is that?)
• Algorithms for hybrid MILP/CP models for a class of optimization problems
• Title not available (Why is that?)
• Principles and Practice of Constraint Programming – CP 2004
• Title not available (Why is that?)
• Principles and Practice of Constraint Programming – CP 2004

Cited In (42)

• A constraint programming method for advanced planning and scheduling system with multilevel structured products
• A job-shop scheduling approach for optimising sugarcane rail operations
• Integer programming and constraint programming in solving a multimachine assignment scheduling problem with deadlines and release dates
• Heuristic data-driven feasibility on integrated planning and scheduling
• Algorithms for hybrid MILP/CP models for a class of optimization problems
• Data-driven feasibility analysis for the integration of planning and scheduling problems
• A hybrid constraint programming approach to a wood procurement problem with bucking decisions
• Constraint programming and operations research
• An update on the comparison of MIP, CP and hybrid approaches for mixed resource allocation and scheduling
• A constraint programming primer
• CP methods for scheduling and routing with time-dependent task costs
• Principles and Practice of Constraint Programming – CP 2004
• A hybrid constraint programming approach to the log-truck scheduling problem
• The Benders decomposition algorithm: a literature review
• Hybrid MIP-CP techniques to solve a multi-machine assignment and scheduling problem in Xpress-CP
• Decomposition techniques for hybrid MILP/CP models applied to scheduling and routing problems
• Single-facility scheduling by logic-based Benders decomposition
• Solving planning and scheduling problems with combined integer and constraint programming
• Petroleum refinery optimization
• Using logic-based Benders decomposition to solve the capacity- and distance-constrained plant location problem
• An integrated method for planning and scheduling to minimize tardiness
• A cutting plane approach for integrated planning and scheduling
• Decomposition methods for the parallel machine scheduling problem with setups
• A two-stage coupled algorithm for an integrated maintenance planning and flowshop scheduling problem with deteriorating machines
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Logic-based MultiObjective Optimization for Restoration Planning
• Solving an integrated job-shop problem with human resource constraints
• A hybrid approach to scheduling with earliness and tardiness costs
• Scheduling of tests on vehicle prototypes using constraint and integer programming
• Matheuristic for the decentralized factories scheduling problem
• Planning and Scheduling by Logic-Based Benders Decomposition
• Planning and Scheduling to Minimize Tardiness
• Solving integrated process planning, dynamic scheduling, and due date assignment using metaheuristic algorithms
• Stochastic allocation and scheduling for conditional task graphs in multi-processor systems-on-chip
• Solving an integrated employee timetabling and job-shop scheduling problem via hybrid branch-and-bound
• Cut generation for an integrated employee timetabling and production scheduling problem
• Logic-based Benders decomposition for large-scale optimization
• Integration of mathematical programming with constraint programming for multi-objective planning and scheduling
• Hybrid algorithm for scheduling with regard for reinvestment of profits
• A decomposition approach for solving a broadcast domination network design problem
• Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines
• Scheduling of jobs on dissimilar parallel machine using computational intelligence algorithms

This page was built for publication: A hybrid method for the planning and scheduling

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