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.
Odior, A & Oyawale, F (2021). AN ALGORITHM FOR JOB SCHEDULING IN 2-MACHINE FLOW SHOP PROBLEM. Afribary. Retrieved from https://afribary.com/works/an-algorithm-for-job-scheduling-in-2-machine-flow-shop-problem
Odior, A and F Oyawale "AN ALGORITHM FOR JOB SCHEDULING IN 2-MACHINE FLOW SHOP PROBLEM" Afribary. Afribary, 25 Mar. 2021, https://afribary.com/works/an-algorithm-for-job-scheduling-in-2-machine-flow-shop-problem. Accessed 22 Dec. 2024.
Odior, A, F Oyawale . "AN ALGORITHM FOR JOB SCHEDULING IN 2-MACHINE FLOW SHOP PROBLEM". Afribary, Afribary, 25 Mar. 2021. Web. 22 Dec. 2024. < https://afribary.com/works/an-algorithm-for-job-scheduling-in-2-machine-flow-shop-problem >.
Odior, A and Oyawale, F . "AN ALGORITHM FOR JOB SCHEDULING IN 2-MACHINE FLOW SHOP PROBLEM" Afribary (2021). Accessed December 22, 2024. https://afribary.com/works/an-algorithm-for-job-scheduling-in-2-machine-flow-shop-problem