AN ALGORITHM FOR JOB SCHEDULING IN 2-MACHINE FLOW SHOP PROBLEM

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.

Overall Rating

0

5 Star
(0)
4 Star
(0)
3 Star
(0)
2 Star
(0)
1 Star
(0)
APA

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

MLA 8th

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 18 Nov. 2024.

MLA7

Odior, A, F Oyawale . "AN ALGORITHM FOR JOB SCHEDULING IN 2-MACHINE FLOW SHOP PROBLEM". Afribary, Afribary, 25 Mar. 2021. Web. 18 Nov. 2024. < https://afribary.com/works/an-algorithm-for-job-scheduling-in-2-machine-flow-shop-problem >.

Chicago

Odior, A and Oyawale, F . "AN ALGORITHM FOR JOB SCHEDULING IN 2-MACHINE FLOW SHOP PROBLEM" Afribary (2021). Accessed November 18, 2024. https://afribary.com/works/an-algorithm-for-job-scheduling-in-2-machine-flow-shop-problem