Lower bounds for resource-constrained project scheduling problems.
From MaRDI portal
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
- Publication:4938774
- On some implementations of solving the resource constrained project scheduling problems
Cites work
- 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?)
- 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.
- Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm
- PSPLIB -- a project scheduling problem library
- Project scheduling with multiple modes: A comparison of exact algorithms
- Resource-constrained project scheduling: Notation, classification, models, and methods
- The multi-mode resource-constrained project scheduling problem with generalized precedence relations
Cited in
(37)- On linear lower bounds for the resource constrained project scheduling problem.
- The preemptive stochastic resource-constrained project scheduling problem
- The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan
- A computational study of constraint programming approaches for resource-constrained project scheduling with autonomous learning effects
- New model and heuristics for safety stock placement in general acyclic supply chain networks
- Project scheduling with finite or infinite number of activity processing modes -- a survey
- Providing lower bounds for the multi-mode resource-constrained project scheduling problem
- On the efficient modeling and solution of the multi-mode resource-constrained project scheduling problem with generalized precedence relations
- The resource-constrained activity insertion problem with minimum and maximum time lags
- A random key based genetic algorithm for the resource constrained project scheduling problem
- Scheduling projects with multi-skilled personnel by a hybrid MILP/CP Benders decomposition algorithm
- New concepts for activity float in resource-constrained project management
- An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the resource constrained project scheduling problem
- A general model for cyclic machine scheduling problems
- Lower bounds for the event scheduling problem with consumption and production of resources
- Resource-constrained project scheduling: Notation, classification, models, and methods
- A preemptive bound for the resource constrained project scheduling problem
- Considering project management activities for engineering design groups
- An exact composite lower bound strategy for the resource-constrained project scheduling problem
- A mathematical model for the multi-mode resource-constrained project scheduling problem with mode dependent time lags
- Solving project scheduling problems by minimum cut computations
- Scheduling the truckload operations in automatic warehouses
- A constructive branch-and-bound algorithm for the project duration problem with partially renewable resources and general temporal constraints
- A Column Generation Based Destructive Lower Bound for Resource Constrained Project Scheduling Problems
- A branch-and-bound algorithm for the unit-capacity resource constrained project scheduling problem with transfer times
- Solving multi-mode time–cost–quality trade-off problems under generalized precedence relations
- scientific article; zbMATH DE number 5132358 (Why is no real title available?)
- A branch-and-price algorithm for stable workforce assignments with hierarchical skills
- Optimization guided lower and upper bounds for the resource investment problem
- Minimizing the completion time of a project under resource constraints and feeding precedence relations: a Lagrangian relaxation based lower bound
- Project selection, scheduling and resource allocation with time dependent returns
- Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times
- A linear programming and constraint propagation-based lower bound for the RCPSP
- scientific article; zbMATH DE number 1405789 (Why is no real title available?)
- Computing redundant resources for the resource constrained project scheduling problem
- Lagrangian relaxation-based lower bound for resource-constrained modulo scheduling
- Lower bounds for a multi-skill project scheduling problem
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)
