Approximability results for the resource-constrained project scheduling problem with a single type of resources

DOI10.1007/S10479-012-1106-5MaRDI QIDQ744638zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

lower boundsmakespanproject schedulingupper bounds

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

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

Cites work

• A Strip-Packing Algorithm with Absolute Performance Bound 2
• A branch and bound algorithm for the resource-constrained project scheduling problem
• A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations
• Algorithms for some maximization scheduling problems on a single machine
• An efficient optimal solution procedure for the preemptive 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
• Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem
• Experimental investigation of heuristics for resource-constrained project scheduling: an update
• On linear lower bounds for the resource constrained project scheduling problem.
• On project scheduling problem
• PSPLIB -- a project scheduling problem library
• Single machine parallel batch scheduling subject to precedence constraints

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

Describes a project that uses

Uses Software

• PSPLIB

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)