Lower bounds for resource-constrained project scheduling problems.
From MaRDI portal
The article treats a very general formulated scheduling problem, the so-called ``multi-mode resource-constrained project scheduling problem with minimal and maximal time-lags. It handles with a combination of renewable (persons, machines) and non-renewable resources (money, energy), each activity can be processed in different modes (for each mode a duration is given resulting in an activity/duration matrix for each activity in each mode). Between the activities there are also minimal and maximal time-lags restricting the start-times of the activities dependent from the start times of other activities. The objective is to find a solution with minimal makespan fulfilling all restrictions concerning starting times and resources. The problem is known as an NP-hard problem. A small example illustrates all the constraints and input data. The main method (destructive) for generating lower bounds for the makespan is presented. There are two different approaches generating these bounds, namely proving infeasibility for a given threshold and a linear programming formulation of the problem. At the end numerical results for problems up to 100 activities are shown.
Recommendations
- On linear lower bounds for the resource constrained project scheduling problem.
- scientific article; zbMATH DE number 5132358
- A branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lags
- scientific article; zbMATH DE number 1405789
- On some implementations of solving the resource constrained project scheduling problems
Cites work
- A branch and bound algorithm for the resource-constrained project scheduling problem
- A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations
- A linear programming and constraint propagation-based lower bound for the RCPSP
- A new and efficient heuristic for scheduling projects with resource restrictions and multiple execution modes
- A time-oriented branch-and-bound algorithm for resource-constrained project scheduling with generalised precedence constraints
- An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation
- Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling
- Formulation and tabu search algorithm for the resource constrained project scheduling problem.
- scientific article; zbMATH DE number 1728543 (Why is no real title available?)
- scientific article; zbMATH DE number 4135692 (Why is no real title available?)
- scientific article; zbMATH DE number 1264426 (Why is no real title available?)
- scientific article; zbMATH DE number 1405789 (Why is no real title available?)
- Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm
- Project scheduling with multiple modes: A comparison of exact algorithms
- PSPLIB -- a project scheduling problem library
- Resource-constrained project scheduling: Notation, classification, models, and methods
- The multi-mode resource-constrained project scheduling problem with generalized precedence relations
Cited in
(40)- The resource-constrained activity insertion problem with minimum and maximum time lags
- On linear lower bounds for the resource constrained project scheduling problem.
- A linear programming and constraint propagation-based lower bound for the RCPSP
- An exact composite lower bound strategy for the resource-constrained project scheduling problem
- Lower bounds for the event scheduling problem with consumption and production of resources
- An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the resource constrained project scheduling problem
- The preemptive stochastic resource-constrained project scheduling problem
- New model and heuristics for safety stock placement in general acyclic supply chain networks
- Resource-constrained project scheduling: Notation, classification, models, and methods
- Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling
- A computational study of constraint programming approaches for resource-constrained project scheduling with autonomous learning effects
- Considering project management activities for engineering design groups
- Scheduling projects with multi-skilled personnel by a hybrid MILP/CP Benders decomposition algorithm
- Project selection, scheduling and resource allocation with time dependent returns
- On the efficient modeling and solution of the multi-mode resource-constrained project scheduling problem with generalized precedence relations
- Lagrangian relaxation-based lower bound for resource-constrained modulo scheduling
- Solving project scheduling problems by minimum cut computations
- A branch-and-price algorithm for stable workforce assignments with hierarchical skills
- scientific article; zbMATH DE number 5132358 (Why is no real title available?)
- Solving multi-mode time–cost–quality trade-off problems under generalized precedence relations
- A Column Generation Based Destructive Lower Bound for Resource Constrained Project Scheduling Problems
- A preemptive bound for the resource constrained project scheduling problem
- Providing lower bounds for the multi-mode resource-constrained project scheduling problem
- Optimization guided lower and upper bounds for the resource investment problem
- scientific article; zbMATH DE number 1405789 (Why is no real title available?)
- Lower bounds for a multi-skill project scheduling problem
- The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan
- A constructive branch-and-bound algorithm for the project duration problem with partially renewable resources and general temporal constraints
- A branch-and-bound algorithm for the unit-capacity resource constrained project scheduling problem with transfer times
- Project scheduling with finite or infinite number of activity processing modes -- a survey
- New concepts for activity float in resource-constrained project management
- Fifty years of research on resource-constrained project scheduling explored from different perspectives
- Bilinear branch and check for unspecified parallel machine scheduling with shift consideration
- Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times
- Minimizing the completion time of a project under resource constraints and feeding precedence relations: a Lagrangian relaxation based lower bound
- Computing redundant resources for the resource constrained project scheduling problem
- Scheduling the truckload operations in automatic warehouses
- A mathematical model for the multi-mode resource-constrained project scheduling problem with mode dependent time lags
- A random key based genetic algorithm for the resource constrained project scheduling problem
- A general model for cyclic machine scheduling problems
This page was built for publication: Lower bounds for resource-constrained project scheduling problems.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1399575)
