An Incomplete Constraint-Based System for Scheduling with Renewable Resources

被引:2
作者
Pralet, Cedric [1 ]
机构
[1] Off Natl Etud & Rech Aerosp, F-31055 Toulouse, France
来源
PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING (CP 2017) | 2017年 / 10416卷
关键词
SETUP TIMES; BOUND METHOD; SHOP PROBLEM; ALGORITHM; ORDER;
D O I
10.1007/978-3-319-66158-2_16
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
In this paper, we introduce a new framework for managing several kinds of renewable resources, including disjunctive resources, cumulative resources, and resources with setup times. In this framework, we use a list scheduling approach in which a priority order between activities must be determined to solve resource usage conflicts. In this context, we define a new differentiable constraint-based local search invariant which transforms a priority order into a full schedule and which incrementally maintains this schedule in case of change in the order. On top of that, we use multiple neighborhoods and search strategies, and we get new best upper bounds on several scheduling benchmarks.
引用
收藏
页码:243 / 261
页数:19
相关论文
共 38 条
  • [1] EXTENDING CHIP IN ORDER TO SOLVE COMPLEX SCHEDULING AND PLACEMENT PROBLEMS
    AGGOUN, A
    BELDICEANU, N
    [J]. MATHEMATICAL AND COMPUTER MODELLING, 1993, 17 (07) : 57 - 73
  • [2] A survey of scheduling problems with setup times or costs
    Allahverdi, Ali
    Ng, C. T.
    Cheng, T. C. E.
    Kovalyov, Mikhail Y.
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 187 (03) : 985 - 1032
  • [3] [Anonymous], 1993, Modern Heuristics Technics for Combinatorial Problems: Tabu Search pp
  • [4] Insertion techniques for static and dynamic resource-constrained project scheduling
    Artigues, C
    Michelon, P
    Reusser, S
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2003, 149 (02) : 249 - 267
  • [5] A branch and bound method for the job-shop problem with sequence-dependent setup times
    Artigues, Christian
    Feillet, Dominique
    [J]. ANNALS OF OPERATIONS RESEARCH, 2008, 159 (01) : 135 - 159
  • [6] Improvements to the Or-opt heuristic for the symmetric travelling salesman problem
    Babin, G.
    Deneault, S.
    Laporte, G.
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2007, 58 (03) : 402 - 407
  • [7] Job shop scheduling with setup times, deadlines and precedence constraints
    Balas, Egon
    Simonetti, Neil
    Vazacopoulos, Alkis
    [J]. JOURNAL OF SCHEDULING, 2008, 11 (04) : 253 - 262
  • [8] Bender MA, 2002, LECT NOTES COMPUT SC, V2461, P152
  • [9] Brucker P, 1996, OR SPEKTRUM, V18, P145, DOI 10.1007/BF01539706
  • [10] Resource-constrained project scheduling: Notation, classification, models, and methods
    Brucker, P
    Drexl, A
    Mohring, R
    Neumann, K
    Pesch, E
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1999, 112 (01) : 3 - 41