Insertion techniques for static and dynamic resource-constrained project scheduling.
type: Item
instance of: scholarly article
title: Insertion techniques for static and dynamic resource-constrained project scheduling.
zbMATH Open document ID: 1040.90013
DOI: 10.1016/S0377-2217(02)00758-0
author: Christian Artigues
author: Stéphane Reusser
author: Philippe Michelon
published in: European Journal of Operational Research
publication date: 2003-07-30T00:00:00Z
review text: In the paper the Resource-Constrained Project Scheduling Problem (RCPSP) minimizing the makespan in static and dynamic environments is considered. Based on a flow network model for feasible schedules a polynomial insertion algorithm is developed which inserts one activity into an existing schedule. This algorithm is used for robust rescheduling in a dynamic environment and as a subroutine in a tabu search procedure for the static RCPSP. 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 potential of the proposed concept.
reviewed by: Sigrid Knust
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 1957036
zbMATH Keywords: resource-constrained project scheduling
zbMATH Keywords: tabu search
zbMATH Keywords: robust scheduling
zbMATH Keywords: flow network
describes a project that uses: PSPLIB
describes a project that uses: BL data set
MaRDI profile type: Publication
cites work: A polynomial activity insertion algorithm in a multi-resource schedule with cumulative constraints and multiple modes
cites work: Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems
cites work: Q4495168
cites work: Tabu-search for the multi-mode job-shop problem
cites work: Resource-constrained project scheduling: Notation, classification, models, and methods
cites work: Multi-resource shop scheduling with resource flexibility
cites work: Q4398250
cites work: Q4248938
cites work: Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem
cites work: Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling
cites work: Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems
cites work: Q4851825
Recommended article: Insertion Algorithms with Justification for Solving the Resource-Constrained Project Scheduling Problem
Recommended article: Resource-constrained project scheduling: A survey of recent developments.
Recommended article: A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling
Recommended article: On some implementations of solving the resource constrained project scheduling problems
Recommended article: A constraint-based perspective in resource constrained project scheduling
Recommended article: Project scheduling with time-varying resource constraints
Recommended article: Q2779816
Recommended article: Resource-constrained project scheduling. Exact methods for the multi-mode case
Recommended article: Q4233362
Recommended article: Q3014334
description: scientific article; zbMATH DE number 1957036