The following pages link to PSPLIB (Q13492):
Displaying 50 items.
- Approximability results for the resource-constrained project scheduling problem with a single type of resources (Q744638) (← links)
- Simulated annealing for financing cost distribution based project payment scheduling from a joint perspective (Q744648) (← links)
- Railway scheduling reduces the expected project makespan over roadrunner scheduling in a multi-mode project scheduling environment (Q744657) (← links)
- On the use of genetic programming to evolve priority rules for resource constrained project scheduling problems (Q781900) (← links)
- When it is worthwhile to work with the stochastic RCPSP? (Q835549) (← links)
- A two-stage stochastic programming approach for project planning with uncertain activity durations (Q835555) (← links)
- Proactive and reactive strategies for resource-constrained project scheduling with uncertain resource availabilities (Q835585) (← links)
- Time-constrained project scheduling (Q835591) (← links)
- Experimental investigation of heuristics for resource-constrained project scheduling: an update (Q858327) (← links)
- A genetic algorithm for resource investment project scheduling problem, tardiness permitted with penalty (Q872245) (← links)
- Robust optimization models for project scheduling with resource availability cost (Q880580) (← links)
- Linear programming based algorithms for preemptive and non-preemptive RCPSP (Q884023) (← links)
- Robust execution strategies for project scheduling with unreliable resources and stochastic durations (Q906557) (← links)
- A constraint programming approach for the resource-constrained project scheduling problem (Q940840) (← links)
- Scheduling tests in automotive R\&D projects (Q954930) (← links)
- An exact algorithm for minimizing resource availability costs in project scheduling (Q976490) (← links)
- On the latest starting times and criticality of activities in a network with imprecise durations (Q988966) (← links)
- A survey of variants and extensions of the resource-constrained project scheduling problem (Q992569) (← links)
- On project scheduling problem (Q1003084) (← links)
- Evaluating project completion time in project networks with discrete random activity durations (Q1017440) (← links)
- A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem (Q1037664) (← links)
- Simulated annealing and tabu search for multi-mode project payment scheduling (Q1042041) (← links)
- A priority-rule method for project scheduling with work-content constraints (Q1046055) (← links)
- A branch and bound algorithm for the resource-constrained project scheduling problem (Q1296084) (← links)
- Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm (Q1296105) (← links)
- Insertion techniques for static and dynamic resource-constrained project scheduling. (Q1399570) (← links)
- A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version. (Q1399573) (← links)
- Resource-constrained project scheduling: A critical activity reordering heuristic (Q1399574) (← links)
- Lower bounds for resource-constrained project scheduling problems. (Q1399575) (← links)
- On linear lower bounds for the resource constrained project scheduling problem. (Q1399576) (← links)
- PROGRESS: Optimally solving the generalized resource-constrained project scheduling problem (Q1401645) (← links)
- Resource-constrained project scheduling: A survey of recent developments. (Q1406618) (← links)
- A fuzzy robust scheduling approach for product development projects. (Q1410333) (← links)
- Solving the resource-constrained project scheduling problem by a variable neighbourhood search. (Q1427560) (← links)
- A linear programming and constraint propagation-based lower bound for the RCPSP (Q1590041) (← links)
- Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem (Q1590044) (← links)
- IBM ILOG CP optimizer for scheduling. 20+ years of scheduling with constraints at IBM/ILOG (Q1616392) (← links)
- New strategies for stochastic resource-constrained project scheduling (Q1617288) (← links)
- A heuristic procedure to solve the project staffing problem with discrete time/resource trade-offs and personnel scheduling constraints (Q1628053) (← links)
- Computing project makespan distributions: Markovian PERT networks revisited (Q1634063) (← links)
- A path-relinking algorithm for the multi-mode resource-constrained project scheduling problem (Q1651597) (← links)
- Variable neighbourhood search and tabu search for a discrete time/cost trade-off problem to minimize the maximal cash flow gap (Q1652132) (← links)
- An exact composite lower bound strategy for the resource-constrained project scheduling problem (Q1652587) (← links)
- A computational study of exact approaches for the adjustable robust resource-constrained project scheduling problem (Q1654362) (← links)
- A branch and bound algorithm for project scheduling problem with spatial resource constraints (Q1666182) (← links)
- Redundant cumulative constraints to compute preemptive bounds (Q1686060) (← links)
- Lower bounds for the event scheduling problem with consumption and production of resources (Q1686062) (← links)
- Optimal workforce assignment to operations of a paced assembly line (Q1694335) (← links)
- How efficient is a global constraint in practice? A fair experimental framework (Q1706598) (← links)
- An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the resource constrained project scheduling problem (Q1711441) (← links)
