![](images/graphics/blank.gif)
Evaluating the performance of constructive heuristics for the blocking flow shop scheduling problem with setup times
12
lượt xem 1
download
lượt xem 1
download
![](https://tailieu.vn/static/b2013az/templates/version1/default/images/down16x21.png)
This paper addresses the minimization of makespan for the permutation flow shop scheduling problem with blocking and sequence and machine dependent setup times, a problem not yet studied in previous studies. The 14 best known heuristics for the permutation flow shop problem with blocking and no setup times are pre-sented and then adapted to the problem in two different ways; resulting in 28 differ-ent heuristics. The heuristics are then compared using the Taillard database
Chủ đề:
Bình luận(0) Đăng nhập để gửi bình luận!
![](images/graphics/blank.gif)
CÓ THỂ BẠN MUỐN DOWNLOAD