Abstract: The present paper deals with the Flow Shop Scheduling (FSS) models with special structures.  The algorithm to optimize the waiting time of jobs has been proposed. The main goal of the study is to achieve a sequence of jobs that provides the minimum total waiting time of jobs. The numerical example has been solved to present the algorithm structure.

Keywords: Waiting time of jobs, Flow shop, Scheduling, Processing time.

| DOI: 10.17148/IARJSET.2024.11675