AN ALGORITHM FOR JOB SCHEDULING IN 2-MACHINE FLOW SHOP PROBLEM
Subscribe to read and download this work.
ABSTRACT
This paper considers the problem of scheduling in flow-shop by Johnson's Algorithm method and Genetic Algorithm method to find an optimal sequence for n jobs m-machine problem based on minimum elapsed time.
Reviews
No reviews yet.
APA
(2026). AN ALGORITHM FOR JOB SCHEDULING IN 2-MACHINE FLOW SHOP PROBLEM. Afribary. Retrieved June 14, 2026, from http://library.afribary.com/works/an-algorithm-for-job-scheduling-in-2-machine-flow-shop-problem
MLA
"AN ALGORITHM FOR JOB SCHEDULING IN 2-MACHINE FLOW SHOP PROBLEM." Afribary, 6 Jun. 2026, http://library.afribary.com/works/an-algorithm-for-job-scheduling-in-2-machine-flow-shop-problem. Accessed June 14, 2026.
Chicago
"AN ALGORITHM FOR JOB SCHEDULING IN 2-MACHINE FLOW SHOP PROBLEM." Afribary (2026). Accessed June 14, 2026. http://library.afribary.com/works/an-algorithm-for-job-scheduling-in-2-machine-flow-shop-problem