tailieunhanh - Evaluating the performance of constructive heuristics for the blocking flow shop scheduling problem with setup times

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 | Nội dung Text Evaluating the performance of constructive heuristics for the blocking flow shop scheduling problem with setup times