Optimization of Make Span in Jobs and Machines Involving Different Types of Processing Time with Weights of Jobs and Breakdown Machine Time

We provide a novel solution for the ‘n-jobs, three-stage’ flow shop scheduling problem, in which processing times are affected by their respective set-up times, arbitrary time lags, transport time, and system breakdown time. Jobs weights must indicate their relative importance. Processing times are classified into three types, such as power supply, no power supply, un interrupted power supply. The goal of this paper is to achieve the shortest overall time elapsed by finding an optimum or near-optimal sequence. The approach suggested for the managers is very easy to understand and also very useful. A numerical example is used to explain the suggested technique.