Linear programming based algorithms for preemptive and non-preemptive RCPSP

DOI10.1016/j.ejor.2006.09.052zbMath1121.90055OpenAlexW2066447358MaRDI QIDQ884023

Jean Damay, Eric Sanlaville, Alain Quilliot

Publication date: 13 June 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2006.09.052

zbMATH Keywords

linear programmingschedulingcolumn generationpreemptionresource constrained project

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic scheduling theory in operations research (90B35)

Related Items (11)

An effective branch-and-price algorithm for the preemptive resource constrained project scheduling problem based on minimal interval order enumeration ⋮ Branch-and-Cut-and-Price algorithms for the preemptive RCPSP ⋮ Multi-mode resource-constrained project scheduling problems with non-preemptive activity splitting ⋮ Project scheduling with finite or infinite number of activity processing modes -- a survey ⋮ An applicable method for modifying over-allocated multi-mode resource constraint schedules in the presence of preemptive resources ⋮ Multimode preemptive resource investment problem subject to due dates for activities: formulation and solution procedure ⋮ The preemptive stochastic resource-constrained project scheduling problem ⋮ Resource-constrained project scheduling with activity splitting and setup times ⋮ Polyhedral Reformulation of a Scheduling Problem And Related Theoretical Results ⋮ A survey of variants and extensions of the resource-constrained project scheduling problem ⋮ A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem

Uses Software

• PSPLIB

Cites Work

• An efficient optimal solution procedure for the preemptive resource-constrained project scheduling problem
• A relation between multiprocessor scheduling and linear programming
• Resource constraints for preemptive job-shop scheduling
• PSPLIB -- a project scheduling problem library
• A branch and bound algorithm for the resource-constrained project scheduling problem
• A linear programming and constraint propagation-based lower bound for the RCPSP
• Tight LP bounds for resource constrained project scheduling
• Optimal preemptive scheduling on a fixed number of identical parallel machines
• An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation
• Constraint-Propagation-Based Cutting Planes: An Application to the Resource-Constrained Project Scheduling Problem
• Solving Project Scheduling Problems by Minimum Cut Computations
• Représentation de familles ordonnées d'intervalles et applications

This page was built for publication: Linear programming based algorithms for preemptive and non-preemptive RCPSP