Approximability results for the resource-constrained project scheduling problem with a single type of resources
From MaRDI portal
Publication:744638
DOI10.1007/s10479-012-1106-5zbMath1296.90044WikidataQ57633795 ScholiaQ57633795MaRDI QIDQ744638
Alexander A. Lazarev, Evgeny R. Gafarov, 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
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
Related Items
Approximability of scheduling problems with resource consuming jobs, 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
Cites Work
- Algorithms for some maximization scheduling problems on a single machine
- A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations
- Experimental investigation of heuristics for resource-constrained project scheduling: an update
- On project scheduling problem
- An efficient optimal solution procedure for the preemptive resource-constrained project scheduling problem
- PSPLIB -- a project scheduling problem library
- A branch and bound algorithm for the resource-constrained project scheduling problem
- On linear lower bounds for the resource constrained project scheduling problem.
- Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem
- An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation
- An Exact Approach to the Strip-Packing Problem
- Complex Scheduling
- A Strip-Packing Algorithm with Absolute Performance Bound 2
- Single machine parallel batch scheduling subject to precedence constraints
