Insertion techniques for static and dynamic resource-constrained project scheduling. (Q1399570)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1957036
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Insertion techniques for static and dynamic resource-constrained project scheduling. |
scientific article; zbMATH DE number 1957036 |
Statements
Insertion techniques for static and dynamic resource-constrained project scheduling. (English)
0 references
30 July 2003
0 references
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.
0 references
resource-constrained project scheduling
0 references
tabu search
0 references
robust scheduling
0 references
flow network
0 references
0 references
0 references
0 references
0 references
0.9313379
0 references
0.8870095
0 references
0.88098156
0 references
0.8800105
0 references
0.87927866
0 references
0.8780105
0 references
0.8775093
0 references
