3-Stage productions scheduling with the concept of set UP time including arbitrary lags

In this paper the concept of arbitrary lags (start lag and stop lag) in n-jobs, 3-machines flow shop scheduling problem where setup time are treated as separate from processing time and transportation time of jobs has been studied. The objective of the study is to propose an algorithm by which we can minimize the make-span in three stage flow shop scheduling problem. A numerical illustration is given to demonstrate the computational efficiency of proposed algorithm as a valuable analytical tool for the researchers.