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 条