Abstract
This paper considers the problem of scheduling in flow-shop by Johnson's Algorithm method, Branch and- Bound Algorithm method and Genetic Algorithm-seethed to find an optimal sequence for n jobs m-machine problem based on minimum elapsed time.ln scheduling the two machine flow shop problem F211 I C, one has to determine a schedule that minimizes the sum of , finishing times of an arbitrary number of jobs that need to be executed on two machines, such that each job must complete processing on machine 1 before starting on machine 2. We propose a heuristic for approximating the solution for the F211I C, problem using a genetic algorithm.
, A & and, F (2021). A Genetic Algorithm for Job Scheduling in Two Machine Flow Shop Problem. Afribary. Retrieved from https://afribary.com/works/a-genetic-algorithm-for-job-scheduling-in-two-machine-flow-shop-problem
, A..O.·Odior1.;: and F.A. And "A Genetic Algorithm for Job Scheduling in Two Machine Flow Shop Problem" Afribary. Afribary, 16 May. 2021, https://afribary.com/works/a-genetic-algorithm-for-job-scheduling-in-two-machine-flow-shop-problem. Accessed 07 May. 2024.
, A..O.·Odior1.;:, F.A. And . "A Genetic Algorithm for Job Scheduling in Two Machine Flow Shop Problem". Afribary, Afribary, 16 May. 2021. Web. 07 May. 2024. < https://afribary.com/works/a-genetic-algorithm-for-job-scheduling-in-two-machine-flow-shop-problem >.
, A..O.·Odior1.;: and And, F.A. . "A Genetic Algorithm for Job Scheduling in Two Machine Flow Shop Problem" Afribary (2021). Accessed May 07, 2024. https://afribary.com/works/a-genetic-algorithm-for-job-scheduling-in-two-machine-flow-shop-problem