WEKO3
アイテム
Feasibility of Hungarian Algorithm based Scheduling
http://hdl.handle.net/10098/3024
http://hdl.handle.net/10098/30242597ea7d-7bab-4f93-a999-075e8f019002
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
SMC2010-1185-1190.pdf (180.4 kB)
|
|
| Item type | 学術雑誌論文 / Journal Article(1) | |||||
|---|---|---|---|---|---|---|
| 公開日 | 2011-02-22 | |||||
| タイトル | ||||||
| タイトル | Feasibility of Hungarian Algorithm based Scheduling | |||||
| 言語 | ||||||
| 言語 | eng | |||||
| キーワード | ||||||
| 主題Scheme | Other | |||||
| 主題 | scheduling | |||||
| キーワード | ||||||
| 主題Scheme | Other | |||||
| 主題 | hungarian algorithm | |||||
| キーワード | ||||||
| 主題Scheme | Other | |||||
| 主題 | near-optimal schedules | |||||
| 資源タイプ | ||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_1843 | |||||
| 資源タイプ | other | |||||
| 著者 |
TAMURA, Shinsuke
× TAMURA, Shinsuke× KODERA, Yuki× TANIGUCHI, Shuji× YANASE, Tatsuro |
|||||
| 抄録 | ||||||
| 内容記述タイプ | Abstract | |||||
| 内容記述 | An optimal resource allocation algorithm, Hungarian algorithm, is not directly applicable to manufacturing scheduling problems, because solutions of resource allocation problems may violate precedence constraints among processes that constitute individual manufacturing jobs. To apply Hungarian algorithm to scheduling problems, in this paper, several strategies for assigning prices to time slots of individual machines, which are allocated to processes, are proposed. Preliminary experimentation results showed that these strategies can generate near optimal schedules, i.e. when lengths of scheduling horizons were larger than 3 times of the maximum lengths of jobs, generated schedules could complete given jobs while maintaining the deterioration of the efficiency less than 5% from optimal schedules. | |||||
| 書誌情報 |
Systems Man and Cybernetics (SMC),2010 IEEE International Conference on p. 1185-1190, 発行日 2010 |
|||||
| ISSN | ||||||
| 収録物識別子タイプ | ISSN | |||||
| 収録物識別子 | 1062922X | |||||
| 書誌レコードID | ||||||
| 識別子タイプ | NCID | |||||
| 関連識別子 | TD00006791 | |||||
