Strong and efficient filtering algorithms for scheduling constraints

针对调度约束的强大且高效的过滤算法

• 批准号: RGPIN-2016-05953
• 负责人: Quimper, ClaudeGuy
• 金额: $ 2.26万
• 依托单位: Université Laval
• 依托单位国家: 加拿大
• 项目类别: Discovery Grants Program - Individual
• 财政年份: 2016
• 资助国家: 加拿大
• 起止时间: 2016-01-01 至 2017-12-31
• 项目状态: 已结题
• 来源: https://www.nserc-crsng.gc.ca/ase-oro/Details-Detailles_eng.asp?id=616010
• 关键词: Strong; efficient; filtering; algorithms; scheduling

Scheduling is the process of determining in what order a collection of operations, tasks, or activities should be executed so that the resources required for their executions are not overloaded. The tasks are generally subject to a variety of constraints and the problem comes with an optimization criteria. Scheduling problems are generally NP-Hard and require special techniques to be efficiently solved. Constraint Programming (CP) is a technique issued from artificial intelligence that proved itself very efficient to solve scheduling problems. Despite recent advances, industrial problems remain hard to solve. Due to long computation times, solvers are halted before the optimal solution is found and therefore return sub-optimal schedules that can cause delays in airports or idle times on an assembly line. These inconveniences would be avoided if faster solvers were developed. The success of constraint programming for solving scheduling problems comes from its filtering algorithms that reason over the scheduling constraints to prune the search space. These algorithms apply several filtering rules based on a relaxation of the scheduling problem. If the relaxed version of the scheduling problem forbids a task to start at a given time, the solver can safely discard these solutions and spend time exploring another part of the search space. By improving the relaxation used by the filtering rules, it is possible to filter larger portions of the search space and therefore to speed up the solving process. The long-term objective of this program is to increase the speed of constraint-based schedulers to find large and complex optimal schedules in a reasonable time. This is achieved by fulfilling 3 sub-objectives. 1) Designing filtering algorithms based on stronger relaxations that achieve more filtering than existing ones; 2) Designing filtering algorithms based on relaxations that are aware of the objective criterion; 3) Designing faster filtering algorithms. We propose a research program that will fully train 2 new Ph.D. students, 3 new master students, and allow one actual Ph.D. student to complete his thesis. Moreover, this program offers 3 internships for undergrad students. One master and one doctoral student will develop stronger relaxations that will offer a better pruning of the search space. One new Ph.D. and one finishing Ph.D. student will work on filtering rules that are adapted to the objective criterion. Finally, two master students will work on faster algorithms that enforce existing filtering rules.

调度是确定一组操作、任务或活动应以何种顺序执行的过程，以便执行这些操作、任务或活动所需的资源不会过载。这些任务通常受到各种各样的约束，并且问题伴随着优化标准。调度问题通常是np困难的，需要特殊的技术才能有效地解决。约束规划（CP）是由人工智能提出的一种技术，它被证明是解决调度问题的有效方法。