Permutation flow shop scheduling with earliness and tardiness penalties

Abstract

We consider the permutation flow shop scheduling problem with earliness and tardiness penalties (E/T) and common due date for jobs. We show that the problem can be sub-divided into three cases: (i) the due date is such that all jobs are necessarily tardy; (ii) the due date is unrestricted; and (iii) the due date is between the two. Based on analytical results we provide partial characterisation of the optimal solution and develop a comprehensive approach for solving the problem over the entire range of due dates. Our approach, which draws upon the existing literature and results for the single machine problem, successfully exploits the properties of the optimal solution. Limited computational results indicate that the performance of the heuristic is reasonable and has the potential to significantly improve performance. This approach has been incorporated as part of the scheduling module of the production planning and scheduling system we developed for a medium-sized bulk drug manufacturer.