A Job Scheduling Algorithm for 2 - Machine Flow Shop Problem, “This paper has been withdrawn”

  • Authors

    • Andrew Odior University of Benin, Benin City
    • Festus Oyawale University of Ibadan
    https://doi.org/10.14419/ijet.v1i4.259

    Received date: July 16, 2012

    Accepted date: August 8, 2012

    Published date: August 15, 2012

  • 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. In scheduling the two machine flow shop problem F2|| , 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   problem using a genetic algorithm.                                                

    Author Biographies

    • Andrew Odior, University of Benin, Benin City
      Associate Professor, Production Engineering Department
    • Festus Oyawale, University of Ibadan
      Associate Professor, Industrial/Manufacturing Engineering Department

  • References

    1. V. Smita and S. Paheli, “Flow-shop Sequencing Model using Genetic Algorithm”, International Journal of Computational and Applied Mathematics. Vol. 4, No. 2, (2009), pp 111–114.
    2. J. Blazewics, P. Erwin, S. Margozata and W. Frank, “The two-machine flow-shop problem with weighted late work criterion and common due date”. European Journal of Operational Research, Vol. 165, (2005), pp.408–415.
    3. A. O. Odior, O. E. Charles-Owaba and F.A. Oyawale, “Application of Job Scheduling in Small Scale Rice Milling Firm”, ARPN Journal of Engineering and Applied Sciences. Vol. 5, No. 1, (2010), pp 1-5.
    4. H. G. Campbell, R. A. Dudek and M. L. Smith, “A heuristic algorithm for n-job, m-machine sequencing problem”, J. Management Science. Vol. 16, (1970), pp. 630-637.
    5. J. Du, “Minimizing mean flow time in two-machine open shops and flow shops”, Journal of Algorithms. Vol. 14, (1993), pp. 24-44.
    6. C. F. Liaw, “An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops”, Journal of Computers and Operations Research, Vol. 35, No. 10, (2008), pp. 3276-3283
    7. J. Holland, Adaptation in Natural and ArtificialSystems. MIT Press, Cambridge, (1992).
    8. R. M. Golden, Mathematical Methods for NeuralNetwork Analysis and Design. MIT Press, Cambridge, Massachusetts, (1996).
    9. P. Brucker, Scheduling Algorithms. Springer, 4th edition, 2004.
    10. A. Oulamara, “Makespan minimization in a nowait flow shop problem with two batching machines”, Computers and Operations Research, Vol. 34, (2007), pp. 1033–1050.
    11. H. Allaoui, A. Artiba and E. Aghezzaf, “Simultaneoulsy scheduling n jobs and the preventive maintenance on the two-machine flow shop to minimize the makespan. International Journal of Production Economics, Vol. 112, No. 1, (2008), pp 161-167.
    12. M. Wall, “A Genetic Algorithm for Resource-Constrained Scheduling” PhD thesis, Massachusetts Institute of Technology, Cambridge, Massachussetts, 1996.
    13. M. R. Garey, D. S. Johnson and R. Sethi, “The Complexity of Flowshop and Jobshop Scheduling” Mathematics of operations research, Vol.1, (1976), pp.117–129.
    14. S. M. Johnson, “Optimal two-and-three-stage production schedules with set-up times included” Naval Research Logistic Quaterly, Vol. 1, (1954), pp. 61–68.
    15. A. Kumar, B. Doina and B. Wolfgang, “A Genetic Algorithm for the Two Machine Flow Shop Problem” School of Computer Science University of Nevada Las Vegas, NV 89154, (2007).

  • Downloads

  • How to Cite

    Odior, A., & Oyawale, F. (2012). A Job Scheduling Algorithm for 2 - Machine Flow Shop Problem, “This paper has been withdrawn”. International Journal of Engineering and Technology, 1(4), 305-314. https://doi.org/10.14419/ijet.v1i4.259