Pages that link to "Item:Q850451"

The following pages link to A hybrid method for the planning and scheduling (Q850451):

Displaying 36 items.

• A hybrid constraint programming approach to a wood procurement problem with bucking decisions (Q272019) (← links)
• A hybrid constraint programming approach to the log-truck scheduling problem (Q545549) (← links)
• A job-shop scheduling approach for optimising sugarcane rail operations (Q656056) (← links)
• Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines (Q670464) (← links)
• Stochastic allocation and scheduling for conditional task graphs in multi-processor systems-on-chip (Q707694) (← links)
• Solving an integrated job-shop problem with human resource constraints (Q744642) (← links)
• An integrated method for planning and scheduling to minimize tardiness (Q850465) (← links)
• A two-stage coupled algorithm for an integrated maintenance planning and flowshop scheduling problem with deteriorating machines (Q892903) (← links)
• Solving an integrated employee timetabling and job-shop scheduling problem via hybrid branch-and-bound (Q1010284) (← links)
• Cut generation for an integrated employee timetabling and production scheduling problem (Q1037686) (← links)
• Constraint programming and operations research (Q1616390) (← links)
• An update on the comparison of MIP, CP and hybrid approaches for mixed resource allocation and scheduling (Q1626765) (← links)
• Petroleum refinery optimization (Q1642991) (← links)
• The Benders decomposition algorithm: a literature review (Q1751891) (← links)
• A cutting plane approach for integrated planning and scheduling (Q1761978) (← links)
• A hybrid approach to scheduling with earliness and tardiness costs (Q1861936) (← links)
• Solving planning and scheduling problems with combined integer and constraint programming (Q1864438) (← links)
• Matheuristic for the decentralized factories scheduling problem (Q2290271) (← links)
• Solving integrated process planning, dynamic scheduling, and due date assignment using metaheuristic algorithms (Q2298093) (← links)
• Data-driven feasibility analysis for the integration of planning and scheduling problems (Q2302362) (← links)
• Single-facility scheduling by logic-based Benders decomposition (Q2442086) (← links)
• A decomposition approach for solving a broadcast domination network design problem (Q2442092) (← links)
• Hybrid algorithm for scheduling with regard for reinvestment of profits (Q2487741) (← links)
• A constraint programming primer (Q2513743) (← links)
• Decomposition methods for the parallel machine scheduling problem with setups (Q2806866) (← links)
• Using logic-based Benders decomposition to solve the capacity- and distance-constrained plant location problem (Q2815453) (← links)
• Integration of mathematical programming with constraint programming for multi-objective planning and scheduling (Q2825061) (← links)
• Algorithms for hybrid MILP/CP models for a class of optimization problems (Q2884510) (← links)
• Integer programming and constraint programming in solving a multimachine assignment scheduling problem with deadlines and release dates (Q2892288) (← links)
• Scheduling of Jobs on Dissimilar Parallel Machine Using Computational Intelligence Algorithms (Q3296266) (← links)
• Logic-Based Benders Decomposition for Large-Scale Optimization (Q3296379) (← links)
• Planning and Scheduling by Logic-Based Benders Decomposition (Q3392098) (← links)
• Logic-based MultiObjective Optimization for Restoration Planning (Q3638509) (← links)
• Scheduling of Tests on Vehicle Prototypes Using Constraint and Integer Programming (Q5391959) (← links)
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Q5898794) (← links)
• Principles and Practice of Constraint Programming – CP 2004 (Q5900301) (← links)