A linear programming and constraint propagation-based lower bound for the RCPSP
From MaRDI portal
Publication:1590041
DOI10.1016/S0377-2217(99)00489-0zbMath0990.90055OpenAlexW1964701519MaRDI QIDQ1590041
Publication date: 26 August 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00489-0
schedulingcolumn generationlower boundsconstraint propagationresource-constrained project scheduling problem
Management decision making, including multiple objectives (90B50) Deterministic scheduling theory in operations research (90B35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items
IP-Based Energetic Reasoning for the Resource Constrained Project Scheduling Problem, An effective branch-and-price algorithm for the preemptive resource constrained project scheduling problem based on minimal interval order enumeration, Computing redundant resources for the resource constrained project scheduling problem, Branch-and-Cut-and-Price algorithms for the preemptive RCPSP, Solving resource-constrained project scheduling problems: conceptual validation of FLP formulation and efficient permutation-based ABC computation, A branch and bound algorithm for project scheduling problem with spatial resource constraints, A polyhedral study of event-based models for the resource-constrained project scheduling problem, A project scheduling problem with periodically aggregated resource-constraints, Linear programming based algorithms for preemptive and non-preemptive RCPSP, An \(O(n^2)\) algorithm for time-bound adjustments for the cumulative scheduling problem, A preemptive bound for the resource constrained project scheduling problem, Redundant cumulative constraints to compute preemptive bounds, Lower bounds for resource-constrained project scheduling problems., On linear lower bounds for the resource constrained project scheduling problem., A branch-and-bound algorithm for the unit-capacity resource constrained project scheduling problem with transfer times, A Boolean satisfiability approach to the resource-constrained project scheduling problem, An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the resource constrained project scheduling problem, Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements, A mathematical model for the multi-mode resource-constrained project scheduling problem with mode dependent time lags, A constraint programming approach for the resource-constrained project scheduling problem, A random key based genetic algorithm for the resource constrained project scheduling problem, Towards merging binary integer programming techniques with genetic algorithms, A general model for cyclic machine scheduling problems, Enhanced energetic reasoning-based lower bounds for the resource constrained project scheduling problem, Scheduling and constraint propagation, Event-based MILP models for resource-constrained project scheduling problems, Scheduling projects with multi-skilled personnel by a hybrid MILP/CP Benders decomposition algorithm, Polyhedral Reformulation of a Scheduling Problem And Related Theoretical Results, Maximising the weighted number of activity execution modes in project planning, Preemptive scheduling and antichain polyhedra, Project selection, scheduling and resource allocation with time dependent returns
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- PSPLIB -- a project scheduling problem library
- A branch and bound algorithm for the resource-constrained project scheduling problem
- Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling
- An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation
- Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems
