Methodology to develop heuristic for re-entrant flow shop with two potential dominant machines using bottleneck approach
This paper presents a bottleneck-based methodology to solve scheduling problem of M1,M2,M3,M4,M3,M4 re-entrant flow shop where M1 and M4 have high tendency of being the dominant machines. Two generalised makespan algorithms using bottleneck approach were developed for the identified bottleneck...
保存先:
| 主要な著者: | , |
|---|---|
| フォーマット: | 論文 |
| 言語: | English |
| 出版事項: |
2012
|
| 主題: | |
| オンライン･アクセス: | http://eprints.uthm.edu.my/8049/1/J4741_d0bca5a4021271c23fab3726ebba24d6.pdf http://eprints.uthm.edu.my/8049/ |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|