Pages that link to "Item:Q1399575"
From MaRDI portal
The following pages link to Lower bounds for resource-constrained project scheduling problems. (Q1399575):
Displaying 34 items.
- On the efficient modeling and solution of the multi-mode resource-constrained project scheduling problem with generalized precedence relations (Q280157) (← links)
- A branch-and-price algorithm for stable workforce assignments with hierarchical skills (Q322747) (← links)
- A preemptive bound for the resource constrained project scheduling problem (Q398922) (← links)
- The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan (Q596087) (← links)
- Project scheduling with finite or infinite number of activity processing modes -- a survey (Q621683) (← links)
- New concepts for activity float in resource-constrained project management (Q622136) (← links)
- Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times (Q707000) (← links)
- Minimizing the completion time of a project under resource constraints and feeding precedence relations: a Lagrangian relaxation based lower bound (Q766253) (← links)
- Computing redundant resources for the resource constrained project scheduling problem (Q853022) (← links)
- Scheduling the truckload operations in automatic warehouses (Q863986) (← links)
- A mathematical model for the multi-mode resource-constrained project scheduling problem with mode dependent time lags (Q929315) (← links)
- A random key based genetic algorithm for the resource constrained project scheduling problem (Q947946) (← links)
- A general model for cyclic machine scheduling problems (Q955322) (← links)
- The resource-constrained activity insertion problem with minimum and maximum time lags (Q1041351) (← links)
- On linear lower bounds for the resource constrained project scheduling problem. (Q1399576) (← links)
- A linear programming and constraint propagation-based lower bound for the RCPSP (Q1590041) (← links)
- An exact composite lower bound strategy for the resource-constrained project scheduling problem (Q1652587) (← links)
- Lower bounds for the event scheduling problem with consumption and production of resources (Q1686062) (← links)
- An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the resource constrained project scheduling problem (Q1711441) (← links)
- The preemptive stochastic resource-constrained project scheduling problem (Q1735185) (← links)
- New model and heuristics for safety stock placement in general acyclic supply chain networks (Q1762120) (← links)
- Resource-constrained project scheduling: Notation, classification, models, and methods (Q1806880) (← links)
- Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling (Q1806914) (← links)
- A computational study of constraint programming approaches for resource-constrained project scheduling with autonomous learning effects (Q2117197) (← links)
- Considering project management activities for engineering design groups (Q2226486) (← links)
- Scheduling projects with multi-skilled personnel by a hybrid MILP/CP Benders decomposition algorithm (Q2268503) (← links)
- Project selection, scheduling and resource allocation with time dependent returns (Q2519075) (← links)
- Lagrangian relaxation-based lower bound for resource-constrained modulo scheduling (Q2883566) (← links)
- Solving Project Scheduling Problems by Minimum Cut Computations (Q3114838) (← links)
- (Q3426433) (← links)
- Solving multi-mode time–cost–quality trade-off problems under generalized precedence relations (Q3458826) (← links)
- Optimization guided lower and upper bounds for the resource investment problem (Q4658414) (← links)
- A constructive branch-and-bound algorithm for the project duration problem with partially renewable resources and general temporal constraints (Q6102850) (← links)
- A branch-and-bound algorithm for the unit-capacity resource constrained project scheduling problem with transfer times (Q6109310) (← links)