Solving RCPSP/max by lazy clause generation

DOI10.1007/s10951-012-0285-xzbMath1280.90067OpenAlexW2125886152MaRDI QIDQ2434317

Thibaut Feydy, Andreas Schutt, Peter J. Stuckey, Mark G. Wallace

Publication date: 5 February 2014

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11343/282698

zbMATH Keywords

project schedulingtime windowsconstraint programmingresource constraintsgeneralized precedence constraintslazy clause generation

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Boolean programming (90C09)

Related Items (15)

Linear-time filtering algorithms for the disjunctive constraint and a quadratic filtering algorithm for the cumulative not-first not-last ⋮ On the efficient modeling and solution of the multi-mode resource-constrained project scheduling problem with generalized precedence relations ⋮ An effective approach for scheduling coupled activities in development projects ⋮ The sample analysis machine scheduling problem: definition and comparison of exact solving approaches ⋮ Models and solution procedures for the resource-constrained project scheduling problem with general temporal constraints and calendars ⋮ Combining incomplete search and clause generation: an application to the orienteering problems with time windows ⋮ A branch-and-bound procedure for the resource-constrained project scheduling problem with partially renewable resources and general temporal constraints ⋮ Using constraint programming for solving RCPSP/MAX-cal ⋮ Using dual presolving reductions to reformulate cumulative constraints ⋮ An updated survey of variants and extensions of the resource-constrained project scheduling problem ⋮ Mixed-integer linear programming and constraint programming formulations for solving resource availability cost problems ⋮ A satisfiability and workload-based exact method for the resource constrained project scheduling problem with generalized precedence constraints ⋮ Job sequencing with one common and multiple secondary resources: an A*/beam search based anytime algorithm ⋮ Packing-based branch-and-bound for discrete malleable task scheduling ⋮ Energetic reasoning for energy-constrained scheduling with a continuous resource

Uses Software

• PSPLIB
• CHIP
• Chaff
• G12
• ILOG SCHEDULE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Explaining the \texttt{cumulative} propagator
• An evolutionary algorithm for the resource-constrained project scheduling problem with minimum and maximum time lags
• Scheduling subject to resource constraints: Classification and complexity
• A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations
• Activity-on-node networks with minimal and maximal time lags and their application to make-to-order production
• Resource-constrained project scheduling: A survey of recent developments.
• Resource-constrained project scheduling: Notation, classification, models, and methods
• Propagation via lazy clause generation
• A Boolean satisfiability approach to the resource-constrained project scheduling problem
• A Time-Oriented Branch-and-Bound Algorithm for Resource-Constrained Project Scheduling with Generalised Precedence Constraints
• On a routing problem
• Iterative Flattening Search on RCPSP/max Problems: Recent Developments
• Logic Programming
• A Computing Procedure for Quantification Theory
• A machine program for theorem-proving
• Truncated branch-and-bound, schedule-construction, and schedule-improvement procedures for resource-constrained project scheduling
• A constraint-based method for project scheduling with time windows

This page was built for publication: Solving RCPSP/max by lazy clause generation