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...
Saved in:
| Main Authors: | , |
|---|---|
| 格式: | Article |
| 語言: | English |
| 出版: |
2012
|
| 主題: | |
| 在線閱讀: | http://eprints.uthm.edu.my/8049/1/J4741_d0bca5a4021271c23fab3726ebba24d6.pdf http://eprints.uthm.edu.my/8049/ |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|