Bi-objective hybrid flow shop scheduling with common due date

Abstract

In this paper, the problem of hybrid flow shop scheduling with common due dates (HFSCDD) is studied, and the objectives are to minimize the total waiting time and the total earliness/tardiness issues that arise. This study was motivated by a real-life shop floor, with the predefined goal of meeting the requirements of the final product in many manufacturing industries. Where the final product is assembled from multiple components and, the assembly is only initiated when all components of the product are complete in number. These interrelated components have common due dates. In this study, we developed a mathematical model of HFSCDD which made up of “n” jobs that were processed in “m” machines, located on “I” stages by taking into consideration the common due dates. This problem is classified as being NP-hard, and so an efficient modified genetic algorithm is developed to solve it. The proposed modify GA is developed based on the NSGA II method for large sized problems. The results of the proposed algorithm have been compared with PSO and GA algorithms and showed that the proposed algorithm achieved better performance than existing solutions, since the waiting time and the earliness/tardiness are significantly reduced. This is facilitated by the simultaneous production of components for the same product.