Some theorems of minimizing makespan and range of lateness of flow shop machines

Abstract

One of the most challenging and widely debated issues in scheduling theory is the topic of multi-objective job scheduling. The multiobjective function problem including the makespan and the range of lateness of three machines in a flow shop was explored in this study in order to solve it. Some of the theories discussed in this work have to do with the computation of the precise best time and range of lateness. Two types of the three machines have been created, and the theories for each type have been studied. These theories seek to cut down on the amount of time it takes to complete tasks and the range of lateness.