Resource-constrained project scheduling by simulated annealing
From MaRDI portal
Publication:4230228
DOI10.1080/00207549608905028zbMath0930.90041OpenAlexW2094465335MaRDI QIDQ4230228
No author found.
Publication date: 1 March 1999
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207549608905028
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (25)
Experimental investigation of heuristics for resource-constrained project scheduling: an update ⋮ An efficient genetic algorithm to solve the resource-constrained project scheduling problem with transfer times: the single mode case ⋮ Project scheduling with finite or infinite number of activity processing modes -- a survey ⋮ New concepts for activity float in resource-constrained project management ⋮ A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version. ⋮ Using resource scarceness characteristics to solve the multi-mode resource-constrained project scheduling problem ⋮ Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers ⋮ A hybrid metaheuristic for the resource-constrained project scheduling problem ⋮ New representation to reduce the search space for the resource-constrained project scheduling problem ⋮ A random key based genetic algorithm for the resource constrained project scheduling problem ⋮ Mode-based versus activity-based search for a nonredundant resolution of the multimode resource-constrained project scheduling problem ⋮ An experimental investigation of metaheuristics for the multi-mode resource-constrained project scheduling problem on new dataset instances ⋮ A neurogenetic approach for the resource-constrained project scheduling problem ⋮ A hybrid rank-based evolutionary algorithm applied to multi-mode resource-constrained project scheduling problem ⋮ Theoretical aspects of multicriteria flight gate scheduling: Deterministic and fuzzy models ⋮ A multi‐agent system for the decentralized resource‐constrained multi‐project scheduling problem ⋮ Some efficient multi-heuristic procedures for resource-constrained project scheduling ⋮ Simulated annealing for financing cost distribution based project payment scheduling from a joint perspective ⋮ The multi-mode resource-constrained project scheduling problem with generalized precedence relations ⋮ A new and efficient heuristic for scheduling projects with resource restrictions and multiple execution modes ⋮ A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem ⋮ Simulated annealing and tabu search for multi-mode project payment scheduling ⋮ Activity list representation for a generalization of the resource-constrained project scheduling problem ⋮ An innovative four-layer heuristic for scheduling multi-mode projects under multiple resource constrains ⋮ A multiobjective hybrid ant colony optimization approach applied to the assignment and scheduling problem
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
- Multiobjective network scheduling with efficient use of renewable and nonrenewable resources
- Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
- Project Scheduling with Continuously-Divisible, Doubly Constrained Resources
- Multi-Project Scheduling: Categorization of Heuristic Rules Performance
- 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
- Heuristics for Scheduling Resource-Constrained Projects: An Experimental Investigation
- Scheduling a Project to Maximize Its Present Value: A Zero-One Programming Approach
- Algorithm 520: An Automatic Revised Simplex Method for Constrained Resource Network Scheduling [H]
- An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems
- Solving resource-constrained project scheduling problems by a* search
- Solving Resource-Constrained Network Problems by Implicit Enumeration—Nonpreemptive Case
- An Algorithm for Optimal Project Scheduling under Multiple Resource Constraints
- A Branch and Bound Algorithm for Minimizing Cost in Project Scheduling
- Resource-constrained Project Scheduling — The State of the Art
- An Algorithm for Project (Job) Sequencing with Resource Constraints
This page was built for publication: Resource-constrained project scheduling by simulated annealing
