Solving the resource constrained project scheduling problem with optimization subroutine library

DOI10.1016/0305-0548(95)00074-7zbMath0854.90079OpenAlexW2058090285MaRDI QIDQ1919788

Oya Icmeli, Walter O. Rom

Publication date: 19 January 1997

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(95)00074-7

zbMATH Keywords

makespanresource constrained project schedulingpartially renewable resourcesoptimization subroutine library

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (9)

Modelling and solving generalised operational surgery scheduling problems ⋮ Allocation of partially renewable resources: Concept, capabilities, and applications ⋮ Resource-constrained project scheduling: A survey of recent developments. ⋮ Tri-directional scheduling scheme: theory and computation ⋮ Event-based MILP models for resource-constrained project scheduling problems ⋮ A high-performance exact method for the resource-constrained project scheduling problem ⋮ A survey of variants and extensions of the resource-constrained project scheduling problem ⋮ PSPLIB -- a project scheduling problem library ⋮ Ensuring quality in resource constrained project scheduling

Cites Work

• Unnamed Item
• Computational experience with a backtracking algorithm for solving a general class of precedence and resource-constrained scheduling problems
• A tabu search procedure for the resource constrained project scheduling problem with discounted cash flows
• Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
• Scheduling a project to maximize its net present value: An integer programming approach
• Early-tardy cost trade-offs in resource constrained projects with cash flows: An optimization-guided heuristic approach
• Tabu Search—Part I
• Tabu Search—Part II
• A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
• Scheduling a Project to Maximize Its Present Value: A Zero-One Programming Approach
• Nonpreemptive scheduling of independent tasks with prespecified processor allocations
• A Branch and Bound Procedure for the Resource Constrained Project Scheduling Problem with Discounted Cash Flows

This page was built for publication: Solving the resource constrained project scheduling problem with optimization subroutine library