Flowshop scheduling with machine deterioration based on job sequences

This paper addresses the two-machine permutation flowshop problem with deterioration. The objectives are minimizing makespan and average tardiness. Jobs have a baseline process time in each machine due date. actual to job depends on performance level at start of job, which is function previously processed jobs their wear/deterioration effect machine. article proposes multiple heuristics comprehensive set experiments. results indicate that as group, generate solutions very close optimal for both criteria. Furthermore, no heuristic approach dominant all experimental conditions, thus selection solve practical problems should be based specific characteristics.