A comparative study of computational procedures for the resource constrained project scheduling problem

DOI10.1016/0377-2217(94)90319-0zbMath0790.90044OpenAlexW2095003556MaRDI QIDQ1317169

Hasan Bala, Osman Oguz

Publication date: 13 March 1994

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

Full work available at URL: http://hdl.handle.net/11693/25970

zbMATH Keywords

heuristicsproject scheduling

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)

Related Items

Experimental investigation of heuristics for resource-constrained project scheduling: an update ⋮ Multi-objective metaheuristic algorithms for the resource-constrained project scheduling problem with precedence relations ⋮ A hybrid framework for over-constrained generalized resource-constrained project scheduling problems ⋮ Resource-constrained project scheduling: Notation, classification, models, and methods ⋮ Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation ⋮ Complexity of the scheduling language RSV

Cites Work

• Unnamed Item
• Some efficient multi-heuristic procedures for resource-constrained project scheduling
• A decomposition approach to multi-project scheduling
• Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
• Heuristics for resource-constrained scheduling†
• Two level heuristic for the resource constrained scheduling problem
• Multi-Project Scheduling: Categorization of Heuristic Rules Performance
• Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case
• Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I
• A Horizon-Varying, Zero-One Approach to Project Scheduling
• Heuristics for Scheduling Resource-Constrained Projects: An Experimental Investigation
• Complexity of Scheduling under Precedence Constraints
• An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems
• Solving Resource-Constrained Network Problems by Implicit Enumeration—Nonpreemptive Case
• An Algorithm for Optimal Project Scheduling under Multiple Resource Constraints