Pages that link to "Item:Q5900301"

The following pages link to Principles and Practice of Constraint Programming – CP 2004 (Q5900301):

Displaying 31 items.

• Optimal resource allocation and scheduling for the CELL BE platform (Q545538) (← links)
• Combined planning and scheduling in a divergent production system with co-production: a case study in the lumber industry (Q632662) (← links)
• A hybrid method for the planning and scheduling (Q850451) (← links)
• An integrated method for planning and scheduling to minimize tardiness (Q850465) (← links)
• A Benders approach for the constrained minimum break problem (Q856212) (← links)
• Scheduling internal audit activities: a stochastic combinatorial optimization problem (Q975756) (← links)
• Solving an integrated employee timetabling and job-shop scheduling problem via hybrid branch-and-bound (Q1010284) (← links)
• An update on the comparison of MIP, CP and hybrid approaches for mixed resource allocation and scheduling (Q1626765) (← links)
• A computational study of exact approaches for the adjustable robust resource-constrained project scheduling problem (Q1654362) (← 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)
• Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags (Q2018863) (← links)
• Type-2 integrated process-planning and scheduling problem: reformulation and solution algorithms (Q2146989) (← links)
• Nutmeg: a MIP and CP hybrid solver using branch-and-check (Q2226478) (← links)
• Single-facility scheduling by logic-based Benders decomposition (Q2442086) (← links)
• A fast and accurate technique for mapping parallel applications on stream-oriented MPSoC platforms with communication awareness (Q2481586) (← links)
• Runway sequencing with holding patterns (Q2482798) (← links)
• Hybrid algorithm for scheduling with regard for reinvestment of profits (Q2487741) (← links)
• Searching for mutually orthogonal Latin squares via integer and constraint programming (Q2496074) (← links)
• CP methods for scheduling and routing with~time-dependent task costs (Q2513747) (← 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)
• Planning and Scheduling by Logic-Based Benders Decomposition (Q3392098) (← links)
• Multi-stage Benders Decomposition for Optimizing Multicore Architectures (Q5387619) (← links)
• Integrating operations research in constraint programming (Q5898341) (← links)
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Q5898794) (← links)
• Integrating operations research in constraint programming (Q5900889) (← links)
• Shop scheduling in manufacturing environments: a review (Q6060656) (← links)