Lower bounds for resource-constrained project scheduling problems

Autor(en): Brucker, P
Knust, S 
Stichwörter: ALGORITHM; Business & Economics; column generation; COMPUTING LOWER BOUNDS; constraint propagation; GENERALIZED PRECEDENCE RELATIONS; lower bounds; Management; MODES; multi-mode; Operations Research & Management Science; resource-constrained project scheduling problem; scheduling
Erscheinungsdatum: 2003
Herausgeber: ELSEVIER SCIENCE BV
Journal: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volumen: 149
Ausgabe: 2
Startseite: 302
Seitenende: 313
Zusammenfassung: 
A destructive lower bound for the multi-mode resource-con strained project scheduling problem with minimal and maximal time-lags is presented. Given are n activities which may be processed in different modes without preemptions. During processing certain amounts of renewable and non-renewable resources are needed where the available capacity of each resource type is limited. Furthermore, minimal and maximal time-lags between the activities are given. The objective is to determine a schedule with minimal makespan. The lower bound calculations are based on two methods for proving infeasibility of a given threshold value T for the makespan. The first uses constraint propagation techniques, while the second is based on a linear programming formulation which is solved by a column generation procedure. Computational results are reported for several test instances of the multi-mode problem with and without time-lags and the single-mode version with time-lags. (C) 2002 Elsevier Science B.V. All rights reserved.
Beschreibung: 
7th International Workshop on Project Managment and Scheduling, UNIV OSNABRUCK, MATH INFORMAT DEPT, OSNABRUCK, GERMANY, APR 17-19, 2000
ISSN: 03772217
DOI: 10.1016/S0377-2217(02)00762-2

Show full item record

Page view(s)

3
Last Week
0
Last month
0
checked on Mar 1, 2024

Google ScholarTM

Check

Altmetric