A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version.
type: Item
instance of: scholarly article
title: A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version.
zbMATH Open document ID: 1040.90015
DOI: 10.1016/S0377-2217(02)00761-0
author: K. Bouleimen
author: H. Lecocq
published in: European Journal of Operational Research
publication date: 2003-07-30T00:00:00Z
review text: In the paper simulated annealing algorithms for the resource-constrained project scheduling problem and its multiple mode version minimizing the makespan are presented. They are based on a list representation of schedules and a serial schedule generation scheme. The neighborhoods are defined by shifts of randomly chosen activities and by additional mode changes in the multi-mode case. Computational results are presented for the PSPLIB benchmark instances of \textit{R. Kolisch, A. Sprecher} and \textit{A. Drexl} [Manage. Sci. 41, 1693--1703 (1995; Zbl 0870.90070)] showing the effectiveness of the proposed procedures.
reviewed by: Sigrid Knust
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 1957037
zbMATH Keywords: resource-constrained project scheduling
zbMATH Keywords: multiple modes
zbMATH Keywords: simulated annealing
describes a project that uses: PSPLIB
MaRDI profile type: Publication
cites work: Q3994799
cites work: A robust genetic algorithm for resource allocation in project scheduling
cites work: Q4495168
cites work: Some efficient multi-heuristic procedures for resource-constrained project scheduling
cites work: Resource-constrained project scheduling by simulated annealing
cites work: A branch and bound algorithm for the resource-constrained project scheduling problem
cites work: Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
cites work: A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
cites work: New Benchmark Results for the Resource-Constrained Project Scheduling Problem
cites work: Q4248938
cites work: Project scheduling with multiple modes: A comparison of exact algorithms
cites work: Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem
cites work: Resource-constrained project scheduling: A survey of recent developments.
cites work: Experience with fine-grained parallel genetic algorithms
cites work: Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation
cites work: Adaptive search for solving hard project scheduling problems
cites work: Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems
cites work: Search Heuristics for Resource Constrained Project Scheduling
cites work: An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation
cites work: Resource-constrained project scheduling. Exact methods for the multi-mode case
cites work: An exact algorithm for project scheduling with multiple modes
cites work: Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem
description: scientific article; zbMATH DE number 1957037