Flowshop scheduling with machine deterioration based on job sequences

Abstract

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