tailieunhanh - Critical paths of non-permutation and permutation flow shop scheduling problems

The literature on flow shop scheduling has extensively analyzed two classes of problems: permutation and non-permutation ones (PFS and NPFS). Most of the papers in this field have been just devoted on comparing the solutions obtained in both approaches. Our contribution consists of analyzing the structure of the critical paths determining the makespan of both kinds of schedules for the case of 2 jobs and m-machines. | Critical paths of non-permutation and permutation flow shop scheduling problems

TÀI LIỆU MỚI ĐĂNG