Scheduling and constraint propagation

Autor(en): Brucker, P
Stichwörter: ALGORITHM; BRANCH; branch-and-bound algorithm; COMPUTING LOWER BOUNDS; constraint propagation; linear programming; machine scheduling; Mathematics; Mathematics, Applied; MULTIPLE RESOURCE; project scheduling/resource constraints; TABU SEARCH
Erscheinungsdatum: 2002
Herausgeber: ELSEVIER
Journal: DISCRETE APPLIED MATHEMATICS
Volumen: 123
Ausgabe: 1-3
Startseite: 227
Seitenende: 256
Zusammenfassung: 
The resource-constrained project-scheduling problem (RCPSP) and some of its generalizations are defined. Furthermore, constraint propagation techniques for these problems and related machine scheduling problems are introduced and possible applications of these techniques in connection with lower bound calculations, branch-and-bound methods, and heuristics are discussed. (C) 2002 Elsevier Science B.V. All rights reserved.
Beschreibung: 
Workshop on Discrete Optimization (DO 99), RUTGERS UNIV CTR OPERAT RES, NEW BRUNSWICK, NJ, 1999
ISSN: 0166218X
DOI: 10.1016/S0166-218X(01)00342-0

Show full item record

Page view(s)

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

Google ScholarTM

Check

Altmetric