An Algorithm towards minimizing Make-span of Scheduling 'n' Jobs on 'm' Machines.

One of the common issues in production scheduling is the flow shop sequencing issue. A specific type of manufacturing process follows a predetermined linear structure in a flow shop. To solve a flow shop problem in a static workshop, the goal of this study is to determine the shortest possible total processing time (make-span) for a sequence of 'n' tasks on 'm' machines. The suggested method is based on how each work slopes as it moves from the first to the last machine. This method is contrasted with four popular heuristics (Palmer, CDS, Dannenbring, NEH). The findings of the study for 'n' x 'm' flow shop sequencing problems show that the proposed method is effective and shows a promising amount of progress when compared to the other four heuristic strategies. [ABSTRACT FROM AUTHOR]