A new heuristic for flowshop scheduling problems minimizing system utilization time subject to minimum makespan

This paper presents a heuristic algorithm to solve flow shop scheduling problems (FSSP) with the criterion to minimise the system utilisation time with minimum of maximum completion time (makespan)...