Scheduling and constraint propagation

被引：37
作者：
Brucker, P [1 ]
机构：
[1] Univ Osnabruck, Dept Math & Comp Sci, D-49069 Osnabruck, Germany
来源：
DISCRETE APPLIED MATHEMATICS | 2002年 / 123卷 / 1-3期
关键词：
project scheduling/resource constraints; machine scheduling; constraint propagation; branch-and-bound algorithm; linear programming;
D O I：
10.1016/S0166-218X(01)00342-0
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
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.
引用
收藏
页码：227 / 256
页数：30
相关论文
共 52 条
  • [1] Ahuja R.K., 1993, NETWORK FLOWS THEORY
  • [2] [Anonymous], 1997, LOCAL SEARCH COMBINA
  • [3] [Anonymous], ADV PROJECT SCHEDULI
  • [4] Applegate D., 1991, ORSA Journal on Computing, V3, P149, DOI 10.1287/ijoc.3.2.149
  • [5] BAAR T, 1999, METAHEURISTICS
  • [6] BAPTISTE P, 1998, THESIS U TECHNOLOGIE
  • [7] BLAZEWICZ J, 1996, SCHEDULING COMPUTER
  • [8] Brinkkötter W, 2001, J SCHED, V4, P53, DOI 10.1002/1099-1425(200101/02)4:1<53::AID-JOS59>3.0.CO
  • [9] 2-Y
  • [10] A branch and bound algorithm for the resource-constrained project scheduling problem
    Brucker, P
    Knust, S
    Schoo, A
    Thiele, O
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1998, 107 (02) : 272 - 288
123456