An Effective CDS Algorithm for an Ordered Precedence Constrained Flow Shop Scheduling Problem for n -jobs and m -machines

-Certain flow shop scheduling scenarios require a specific set of jobs to be processed in the specified order during the manufacturing process. Such types of situations in flow shop models are usually called order precedence. The studies on flow shop models integrated with order precedence constraints have received limited attention, to the best of the author's knowledge. To fill this gap, this study addresses a general flow shop model where order precedence is taken into account. We made an attempt to propose a heuristic CDS algorithm and implement it in MATLAB to determine the optimal sequence and the overall flow time. However, a comparative study is not carried out, as no study is devoted to the present model, but the proposed algorithm is tested on a few benchmark test cases, and the results are reported, which may be used for future studies.