An effective branch-and-price algorithm for the preemptive resource constrained project scheduling problem based on minimal interval order enumeration

DOI10.1016/j.ejor.2014.12.037zbMath1346.90375OpenAlexW2073568982MaRDI QIDQ319357

Aziz Moukrim, Hélène Toussaint, Alain Quilliot

Publication date: 6 October 2016

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

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

zbMATH Keywords

project schedulingcolumn generationantichaininterval orderconstraint propagation

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Related Items

Branch-and-Cut-and-Price algorithms for the preemptive RCPSP ⋮ The preemptive stochastic resource-constrained project scheduling problem ⋮ A quantitative approach for the long-term assessment of railway rapid transit network construction or expansion projects ⋮ An updated survey of variants and extensions of the resource-constrained project scheduling problem ⋮ A hybrid adaptively genetic algorithm for task scheduling problem in the phased array radar ⋮ Stochastic project scheduling with hierarchical alternatives ⋮ Preemptive multi-skilled resource constrained project scheduling problem with hard/soft interval due dates

Uses Software

• PSPLIB
• BL data set

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A preemptive bound for the resource constrained project scheduling problem
• Explaining the \texttt{cumulative} propagator
• Linear programming based algorithms for preemptive and non-preemptive RCPSP
• 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
• Multiobjective network scheduling with efficient use of renewable and nonrenewable resources
• An efficient optimal solution procedure for the preemptive resource-constrained project scheduling problem
• PSPLIB -- a project scheduling problem library
• DSS for multiobjective project scheduling
• Insertion techniques for static and dynamic resource-constrained project scheduling.
• On linear lower bounds for the resource constrained project scheduling problem.
• A linear programming and constraint propagation-based lower bound for the RCPSP
• Project scheduling under uncertainty: survey and research potentials
• Resource-constrained project scheduling: Notation, classification, models, and methods
• Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems
• Pre-emption in resource-constrained project scheduling
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation
• A Column Generation Approach for Graph Coloring
• Flow Polyhedra and Resource Constrained Project Scheduling Problems