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...
保存先:
主要な著者: | Bareduan, Salleh Ahmad, Hasan, Sulaiman |
---|---|
フォーマット: | 論文 |
言語: | 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, 等
出版事項: (2013) -
Methodology to develop bottleneck-based heuristic for permutation flow shop scheduling
著者:: Isa, Noor Amira, 等
出版事項: (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, 等
出版事項: (2012)