No Idle Constraint In Flow Shop Scheduling With Transportation Time, Weightage of Jobs And Job Block Criteria

In the present paper, a flow shop scheduling model in two stage under no idle constraint has been studied where the transportation time is taken for transferring a job from one machine to another and the two of the jobs has been grouped as a block. Due to their practicality and significance importance in the actual life scenarios, the weight of jobs is also introduced. The study’s goal is to introduce a heuristic algorithm that, when implemented, offers an optimal or nearly optimal schedule to diminish the idle time and lowering the rental costs. The effectiveness of the proposed approach is demonstrated through a numerical sample.