Computation of job idle time with ‘n’ jobs on ‘k’ machines – a novel approach with case studies

Abstract

One of the most common issues with production scheduling is the flowshop sequencing difficulty. In a flowshop, a particular kind of manufacturing procedure adheres to a specified linear framework. The purpose of this study is to minimize job idle time for a series of 'n' activities on 'k' machines to address a flowshop problem in a static workshop. Based on how each job flows as it progresses from the first to the last machine, the proposed approach is formulated. The study's results for ‘n*k’ flowshop sequencing issues demonstrate that the suggested approach is successful and makes promising strides.