Approximability results for the resource-constrained project scheduling problem with a single type of resources
DOI10.1007/S10479-012-1106-5zbMATH Open1296.90044OpenAlexW2075858883WikidataQ57633795 ScholiaQ57633795MaRDI QIDQ744638FDOQ744638
Authors: Evgeny R. Gafarov, Alexander A. Lazarev, Frank Werner 
Publication date: 26 September 2014
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-012-1106-5
Recommendations
- On project scheduling problem
- On linear lower bounds for the resource constrained project scheduling problem.
- A preemptive bound for the resource constrained project scheduling problem
- On some implementations of solving the resource constrained project scheduling problems
- Tight approximations for resource constrained scheduling and bin packing
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- PSPLIB -- a project scheduling problem library
- Experimental investigation of heuristics for resource-constrained project scheduling: an update
- An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation
- A Strip-Packing Algorithm with Absolute Performance Bound 2
- A branch and bound algorithm for the resource-constrained project scheduling problem
- Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem
- Complex Scheduling
- An exact approach to the strip-packing problem
- An efficient optimal solution procedure for the preemptive resource-constrained project scheduling problem
- On linear lower bounds for the resource constrained project scheduling problem.
- Algorithms for some maximization scheduling problems on a single machine
- Single machine parallel batch scheduling subject to precedence constraints
- A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations
- On project scheduling problem
Cited In (5)
- Approximability of scheduling problems with resource consuming jobs
- On a paper by Christofides et al. for solving the multiple-resource constrained, single project scheduling problem
- A resource type analysis of the integrated project scheduling and personnel staffing problem
- Time symmetry of resource constrained project scheduling with general temporal constraints and take-give resources
- On lower and upper bounds for single machine parallel batch scheduling
Uses Software
This page was built for publication: Approximability results for the resource-constrained project scheduling problem with a single type of resources
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q744638)
