Abstract :

This Paper Presents A Heuristic Method For Solving A Reentrant Flow-shop Scheduling Problem With 2 Machines And N Jobs, Where The Processing Times For Jobs On The 2 Machines Are Specified. We Obtained A Schedule With A Set Of N Jobs To Minimize The Makespan. The Procedure Is Illustrated With The Help Of A Numerical Example. Keywords: Flow Shop, Transportation Time, Weight Of Jobs

Published:

26-10-2026

Issue:

Vol. 26 No. 10 (2026)

Page Nos:

144-147

Section:

Articles

License:

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

How to Cite