1B1 TABU SEARCH FOR RESOURCE CONSTRAINED PROJECT SCHEDULING PROBLEM(Technical session 1B : Meta Heuristics) :

NDLデジタルコレクション
  • Miwa,Go
    Department of Electronics and Information Systems Graduate School of Engineering, Osaka University
  • Nakashima,Yasumasa
    Department of Electronics and Information Systems Graduate School of Engineering, Osaka University
  • Tanio,Tetsuzo
    Department of Electronics and Information Systems Graduate School of Engineering, Osaka University
  • Tatsumi,Keiji
    Department of Electronics and Information Systems Graduate School of Engineering, Osaka University

この論文をさがす

抄録

Many scheduling problems including jobshop and flow-shop scheduling problems can be formulated as the resource constrained project scheduling problem. In recent years, metaheuristic algorithms which can obtain satisficing solutions with small computational cost have been studied. In this paper, we present a new tabu search algorithm CATS (Critical Activity based Tabu Search) for the resource constrained project scheduling problem. Our algorithm employs the list representation of schedules and generates a new schedule S by using serial or parallel scheduling generation scheme form the list. Moreover, we make use of the concept of the total float TF (J, S) which represent importance of activity j in the current schedule S. A neighorhood is defined by using the set defined by the imformation on the total float. The local search is made efficiently in this neighborhood. Moreover, we perform computational experiments and compare our algorithm to other metaheuristic methods.

収録刊行物

キーワード

詳細情報 詳細情報について

問題の指摘

ページトップへ