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

DOI10.1007/s10479-012-1106-5zbMath1296.90044OpenAlexW2075858883WikidataQ57633795 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

zbMATH Keywords

upper boundsproject schedulingmakespanlower bounds

Mathematics Subject Classification ID

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

Related Items (3)

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 ⋮ Approximability of scheduling problems with resource consuming jobs

Uses Software

• PSPLIB

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

This page was built for publication: Approximability results for the resource-constrained project scheduling problem with a single type of resources