A Number of Operations and Time Lags in Flow Shop Scheduling

Abstract

The idea of arbitrary delays (start lag and stop lag) in n-jobs, 3-machine flow shop scheduling problem with the influence of the breakdown interval and job block criteria including transportation time is discussed in this article. The study's goal is to provide an approach for reducing the make-span in a three-stage flow shop scheduling problem. A numerical example is provided to show the suggested algorithm's computational efficiency as a useful analytical tool for academics.