Linear programming based algorithms for preemptive and non-preemptive RCPSP

DOI10.1016/J.EJOR.2006.09.052MaRDI QIDQ884023zbMATH OpenOpenAlexFDO

Authors 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 programmingpreemptionschedulingcolumn generationresource constrained project

Mathematics Subject Classification ID

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

Recommendations

• Linear algorithms for preemptive scheduling of multiprocessor tasks subject to minimal lateness
• Computing optimal preemptive schedules for parallel tasks: linear programming approaches
• Branch-and-cut-and-price algorithms for the preemptive RCPSP
• Preemptive Scheduling, Linear Programming and Network Flows
• A linear programming and constraint propagation-based lower bound for the RCPSP
• On PreemptiveResource Constrained Scheduling: Polynomial-Time Approximation Schemes
• scientific article; zbMATH DE number 2086932
• Solving LP relaxations of large-scale precedence constrained problems
• Line search method for solving a non-preemptive strictly periodic scheduling problem

Cites work

• A branch and bound algorithm for the resource-constrained project scheduling problem
• A linear programming and constraint propagation-based lower bound for the RCPSP
• A relation between multiprocessor scheduling and linear programming
• An efficient optimal solution procedure for the preemptive resource-constrained project scheduling problem
• 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
• Optimal preemptive scheduling on a fixed number of identical parallel machines
• PSPLIB -- a project scheduling problem library
• Représentation de familles ordonnées d'intervalles et applications
• Resource constraints for preemptive job-shop scheduling
• Solving project scheduling problems by minimum cut computations
• Tight LP bounds for resource constrained project scheduling

Cited in

(13)

• scientific article; zbMATH DE number 7656034 (Why is no real title available?)
• Project scheduling with finite or infinite number of activity processing modes -- a survey
• Resource-constrained project scheduling with activity splitting and setup times
• A survey of variants and extensions of the resource-constrained project scheduling problem
• Approaches to solving RCPSP using relaxed problem with consumable resources
• An effective branch-and-price algorithm for the preemptive resource constrained project scheduling problem based on minimal interval order enumeration
• A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem
• Multi-mode resource-constrained project scheduling problems with non-preemptive activity splitting
• Multimode preemptive resource investment problem subject to due dates for activities: formulation and solution procedure
• The preemptive stochastic resource-constrained project scheduling problem
• Branch-and-cut-and-price algorithms for the preemptive RCPSP
• Polyhedral Reformulation of a Scheduling Problem And Related Theoretical Results
• An applicable method for modifying over-allocated multi-mode resource constraint schedules in the presence of preemptive resources

Describes a project that uses

Uses Software

• PSPLIB

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q884023)