The resource constrained project scheduling problem with multiple crashable modes: A heuristic procedure

DOI10.1016/S0377-2217(97)00331-7zbMath0943.90026OpenAlexW1987091081MaRDI QIDQ1296080

Taeho Ahn, S. Selcuk Erenguc

Publication date: 13 September 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00331-7

zbMATH Keywords

resource constrained project schedulingpenalty costactivity costcrashable modesproject cost

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Deterministic scheduling theory in operations research (90B35)

Related Items (5)

The construction of stable project baseline schedules ⋮ A multi-objective imperialist competitive algorithm for solving discrete time, cost and quality trade-off problems with mode-identity and resource-constrained situations ⋮ Project scheduling with finite or infinite number of activity processing modes -- a survey ⋮ A review of the contribution of operational research to project management ⋮ PSPLIB -- a project scheduling problem library

Cites Work

• Some efficient multi-heuristic procedures for resource-constrained project scheduling
• Computational experience with a backtracking algorithm for solving a general class of precedence and resource-constrained scheduling problems
• Optimal procedures for the discrete time/cost trade-off problem in project networks
• Resource-constrained project scheduling. Exact methods for the multi-mode case
• Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
• A Network Flow Computation for Project Cost Curves
• Critical-Path Planning and Scheduling: Mathematical Basis
• Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case
• A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
• A Horizon-Varying, Zero-One Approach to Project Scheduling
• Project scheduling: The effects of problem structure on heuristic performance
• An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems
• Optimum Time Compression in Project Scheduling
• Critical Path Problems with Concave Cost-Time Curves
• Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems

This page was built for publication: The resource constrained project scheduling problem with multiple crashable modes: A heuristic procedure