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: | Bareduan, Salleh Ahmad, Hasan, Sulaiman |
---|---|
格式: | Article |
語言: | English |
出版: |
2012
|
主題: | |
在線閱讀: | http://eprints.uthm.edu.my/8049/1/J4741_d0bca5a4021271c23fab3726ebba24d6.pdf http://eprints.uthm.edu.my/8049/ |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
相似書籍
-
Bottleneck adjacent matching heuristics for scheduling a re-entrant flow shop with dominant machine problem
由: Sh Ahmad, Sh Salleh
出版: (2009) -
Development of improved bottleneck-based heuristic for re-entrant flow shop with dominant machine at M1 and M4
由: Mohd Fidzwan, Md Amin Hamzas, et al.
出版: (2013) -
Methodology to develop bottleneck-based heuristic for permutation flow shop scheduling
由: Isa, Noor Amira, et al.
出版: (2020) -
Bottleneck-based heuristic for three-machine flow shop scheduling
由: Abdul Rahim, Mohd Salleh
出版: (2011) -
Performance evaluation of m3 bottleneck based heuristic for M1M2M3 flow shop
由: Md Amin Hamzas, Mohd Fidzwan, et al.
出版: (2012)