A constraint-based perspective in resource constrained project scheduling

DOI10.1080/00207549408956961zbMath0903.90102OpenAlexW2031574354MaRDI QIDQ4394226

Gündüz Ulusoy, Linet Özdamar

Publication date: 11 June 1998

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207549408956961

zbMATH Keywords

heuristicresource constrained project scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (8)

A local constraint based analysis approach to project scheduling under general resource constraints ⋮ A flexible heuristic for a multi-mode capital constrained project scheduling problem with probabilistic cash inflows ⋮ A hybrid metaheuristic for the resource-constrained project scheduling problem ⋮ Augmenting priority rule heuristics with justification and rollout to solve the resource-constrained project scheduling problem ⋮ Benders decomposition, Lagrangean relaxation and metaheuristic design ⋮ Resource-constrained project scheduling: Notation, classification, models, and methods ⋮ A framework for an interactive project scheduling system under limited resources ⋮ A note on an iterative forward/backward scheduling technique with reference to a procedure by Li and Willis

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• A multiobjective, multi-level heuristic for dynamic resource constrained scheduling problems
• Multiobjective network scheduling with efficient use of renewable and nonrenewable resources
• An iterative scheduling technique for resource-constrained project scheduling
• 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
• Two level heuristic for the resource constrained scheduling problem
• Project Scheduling with Continuously-Divisible, Doubly Constrained Resources
• Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case
• A Horizon-Varying, Zero-One Approach to Project Scheduling
• Project scheduling: The effects of problem structure on heuristic performance
• Technical Note—Finding Some Essential Characteristics of the Feasible Solutions for a Scheduling Problem
• Scheduling a Project to Maximize Its Present Value: A Zero-One Programming Approach
• An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems
• Heuristic Performance and Network/Resource Characteristics in Resource-constrained Project Scheduling
• Solving resource-constrained project scheduling problems by a* search
• Solving Resource-Constrained Network Problems by Implicit Enumeration—Nonpreemptive Case

This page was built for publication: A constraint-based perspective in resource constrained project scheduling