![](images/graphics/blank.gif)
The blocking flow shop scheduling problem
-
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
14p
toritori
11-05-2020
11
1
Download
CHỦ ĐỀ BẠN MUỐN TÌM
![](images/graphics/blank.gif)