2B1 CONSTRAINT PROGRAMMING FOR DYNAMIC SCHEDULING PROBLEMS(Technical session 2B : Combinatorics 1)

スポンサーリンク

概要

• 論文の詳細を見る

• Scheduling problems considered in the literature are often static (activities are known in advance and constraints are fixed). However, every real-life schedule is subject to unexpected events. In these cases, a new solution is needed in a preferably short time and as close as possible to the current solution. In this paper, we present an exact approach for solving dynamic Resource-Constrained Project Scheduling Problems or RCPSP. This approach combines explanation-based constraint programming and operational research techniques. We present our first experimental results that show impressive improvements in both computation time and stability when comparing our approach to a re-execution from scratch.

• 一般社団法人日本機械学会の論文
• 2004-05-24

著者

• Gueret Christelle

  Irccyn Cnrs Umr

• Elkhyari Abdallah

  Ecoled Des Mines De Nantes

• Jussien Narendra

  Ecoled des Mines de Nantes

• Jussien Narendra

  Ecole Des Mines De Nantes

関連論文

• 2B1 CONSTRAINT PROGRAMMING FOR DYNAMIC SCHEDULING PROBLEMS(Technical session 2B : Combinatorics 1)
• 2A2 SUBCONTRACTORS SCHEDULING ON RESIDENTIAL BUILDINGS CONSTRUCTION SITES(Technical session 2A: Application and practice 1)

スポンサーリンク