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

DOI10.1016/S0377-2217(97)00331-7zbMATH Open0943.90026OpenAlexW1987091081MaRDI QIDQ1296080FDOQ1296080

Authors: 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

Recommendations

• The resource constrained project scheduling problem with multiple crashable modes: An exact solution method
• Resource-constrained project scheduling: A heuristic for the multi-mode case
• A new and efficient heuristic for scheduling projects with resource restrictions and multiple execution modes
• Some efficient multi-heuristic procedures for resource-constrained project scheduling
• A metaheuristic approach to the resource constrained project scheduling with variable activity durations and convex cost functions

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)

Cites Work

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

Cited In (9)

• Project scheduling with finite or infinite number of activity processing modes -- a survey
• Heuristic algorithm for RCPSP with the objective of minimizing activities' cost
• A metaheuristic approach to the resource constrained project scheduling with variable activity durations and convex cost functions
• The construction of stable project baseline schedules
• Resource-constrained project scheduling: A heuristic for the multi-mode case
• A multi-objective imperialist competitive algorithm for solving discrete time, cost and quality trade-off problems with mode-identity and resource-constrained situations
• A review of the contribution of operational research to project management
• PSPLIB -- a project scheduling problem library
• The resource constrained project scheduling problem with multiple crashable modes: An exact solution method

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296080)