A computational study of constraint programming approaches for resource-constrained project scheduling with autonomous learning effects

DOI10.1007/978-3-030-78230-6_2OpenAlexW3166844143MaRDI QIDQ2117197

Alessandro Hill, Thomas W. M. Vossen, Jordan Ticktin

Publication date: 21 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-78230-6_2

zbMATH Keywords

constraint programmingresource-constrained project schedulingautonomous learning

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Uses Software

• PSPLIB
• ILOG SCHEDULE
• CP Optimizer

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Temporal linear relaxation in IBM ILOG CP optimizer
• Explaining the \texttt{cumulative} propagator
• Event-based MILP models for resource-constrained project scheduling problems
• The discrete time/cost trade-off problem: Extensions and heuristic procedures
• A survey of variants and extensions of the resource-constrained project scheduling problem
• Scheduling subject to resource constraints: Classification and complexity
• PSPLIB -- a project scheduling problem library
• Lower bounds for resource-constrained project scheduling problems.
• IBM ILOG CP optimizer for scheduling. 20+ years of scheduling with constraints at IBM/ILOG
• Using constraint programming for solving RCPSP/MAX-cal
• On the strength of time-indexed formulations for the resource-constrained project scheduling problem
• Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling
• Fast algorithms for scheduling with learning effects and time-dependent processing times on a single machine
• Single-machine scheduling with time-and-resource-dependent processing times
• A state-of-the-art review on scheduling with learning effects
• Constraint-Propagation-Based Cutting Planes: An Application to the Resource-Constrained Project Scheduling Problem
• A Branch-and-Cut Procedure for the Multimode Resource-Constrained Project-Scheduling Problem
• Topological ordering of a list of randomly-numbered elements of a network
• Orthogonal Packings in Two Dimensions

This page was built for publication: A computational study of constraint programming approaches for resource-constrained project scheduling with autonomous learning effects