K1 BUILDING GENERAL SOLVERS FOR SCHEDULING PROBLEMS(Keynote speech)

スポンサーリンク

概要

• 論文の詳細を見る

• We describe our attempts to build general solvers that cover a large portion of schduling problems encountered in real world applications. For this, we select a list of standard problems, and develop their solvers which are based on local search and metaheuristics. As standard problems, we have chosen so far RCPSP (recource constrained project scheduling problem), CSP (constraint satisfaction problem), VRP (vehicle routing problem), SCP (set covering problem) and others. In this paper, we outline definitions of these problems, algorithmic contents of solvers, and some computational results.

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

著者

• IBARAKI Toshihide

  Graduate School of Informatics, Kyoto University

• Ibaraki Toshihide

  Graduate School Of Informatics Kyoto University

関連論文

• Data Analysis by Positive Decision Trees (Special Issue on New Generation Database Technologies)
• K1 BUILDING GENERAL SOLVERS FOR SCHEDULING PROBLEMS(Keynote speech)

スポンサーリンク