Resource-constrained project scheduling by simulated annealing

Fayez Fouad Boctor

174 citations0/0 files storedInternational Journal of Production Research

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Resource-Constrained Project Scheduling Scheduling and Optimization Algorithms Simulation Techniques and Applications

Abstract

This paper presents a new adaptation of the simulated annealing algorithm for solving non-preemptive resource-constrained project scheduling problems in which resources are limited but renewable from period to period. This algorithm is able to handle single-mode and multi-mode problems and to optimize different objective functions. Statistical experiments show the efficiency of the proposed algorithm even in comparison to some Tabu search heuristics.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 174 citations exist upstream.

References

1969Multiproject Scheduling with Limited Resources: A Zero-One Programming Approach 1992A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem 1977Activity networks: Project planning and control by network models 1982Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case 1975A Comparison of Heuristic and Optimum Solutions in Resource-Constrained Project Scheduling 1987Project scheduling with resource constraints: A branch and bound approach 1984A Comparison of Exact Approaches for Solving the Multiple Constrained Resource, Project Scheduling Problem 1982Multi-Project Scheduling: Categorization of Heuristic Rules Performance

Cited by

2017An efficient genetic algorithm to solve the resource-constrained project scheduling problem with transfer times: The single mode case 1999The multi-mode resource-constrained project scheduling problem with generalized precedence relations 2011Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers 2011On the performance of bee algorithms for resource-constrained project scheduling problem

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.