| Peer-Reviewed

New Algorithm for N-jobs on M-machine Flow Shop Scheduling Problems

Received: 13 November 2015     Accepted: 24 November 2015     Published: 15 January 2016
Views:       Downloads:
Abstract

Because of flow shop scheduling is one of the most important problems in the area of production management, In this paper, what I have did is that, I have developed a new algorithm for n-jobs m-machine flow shop scheduling problem for special case of n-jobs m-machine flow shop scheduling problem. And also, there is a good self explanatory example to explain the algorithm very well.

Published in Applied and Computational Mathematics (Volume 5, Issue 1)
DOI 10.11648/j.acm.20160501.11
Page(s) 1-9
Creative Commons

This is an Open Access article, distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution and reproduction in any medium or format, provided the original work is properly cited.

Copyright

Copyright © The Author(s), 2016. Published by Science Publishing Group

Keywords

N-jobs M-machine, Flow Shop Scheduling Problems

References
[1] Chenge, T. C. E., “Optimal due date determination and scheduling of n- jobs on a single machine”, Journal of the Operation Research society 35, pp. 433-437, 1984.
[2] Ikram, M., “A note on minimization of lateness Cost Function and Determination of Optimal Due – date in two machine problem,” Pure Applied Mathematika sciences, Vol. XXIII, 1-2, March 1986.
[3] Johnson, S. M. “Optimal two and three stage production schedules with setup times included.” Naval Research Logistics Quarterly, Vol I, 61-68, 1954.
[4] Jackson, J. R., “An extension of Johnson’s results on lot scheduling”, Naval Research Logistics Quarterly, Vol 3, pp.201-2003, 1956.
[5] Ibrahim, M.A., “Algorithms for Sequencing and Scheduling,” Industrial Engineering Department, College of Engineering, King saud University, Riyadh, Saudi Arabia.
[6] Osman, M. R., Ismail, N., Zairian, M. R. M, Yusuf, R. M., Sapuan, S. M. “sheet metal Fabrication Scheduling Using Selective Performance Measure and priority Dispatching Rule,” International Journal of Engineering and Technology, Vol. 1 (1), pp. 74-83, 2004.
[7] Taylor, F. W., “Shop Management”, Harper And Bros, New York, 1911.
[8] Herrmann, Jeffrey. W “A history of production Scheduling” in Handbook of Production Scheduling, Springer, New York, 2006.
[9] Dudek, R. A., S. S. Panwalkar, and M. L. Smith, “The lessons for flow shop scheduling Research,” Operation Research, Vol 40(1), pp. 7-13, 1993.
[10] Conway, R. W., Maxwell, W. L., and Miller, L. W. “Theory of Scheduling,” Addison-Wesley Publishing Company, Massachusetts, 1967.
[11] Miloš Šeda “Mathematical Models of Flow Shop and Job Shop Scheduling Problems”, International Journal of Applied Mathematics and Computer Sciences Volume 4 Number 4.
[12] Kerem Bu¨lbu¨l, Philip Kaminsky, Candace Yano,” Flow Shop Scheduling with Earliness, Tardiness, and Intermediate Inventory Holding Costs”, Industrial Engineering and Operations Research, University of California, Berkeley, California 94720-1777.
[13] Mircea ANCĂU, “on solving flow shop scheduling problems” THE PUBLISHING HOUSE PROCEEDINGS OF THE ROMANIAN ACADEMY, Series A, OF THE ROMANIAN ACADEMY Volume 13, Number 1/2012, pp. 71–79.
Cite This Article
  • APA Style

    Geleta Tadele Mohammed. (2016). New Algorithm for N-jobs on M-machine Flow Shop Scheduling Problems. Applied and Computational Mathematics, 5(1), 1-9. https://doi.org/10.11648/j.acm.20160501.11

    Copy | Download

    ACS Style

    Geleta Tadele Mohammed. New Algorithm for N-jobs on M-machine Flow Shop Scheduling Problems. Appl. Comput. Math. 2016, 5(1), 1-9. doi: 10.11648/j.acm.20160501.11

    Copy | Download

    AMA Style

    Geleta Tadele Mohammed. New Algorithm for N-jobs on M-machine Flow Shop Scheduling Problems. Appl Comput Math. 2016;5(1):1-9. doi: 10.11648/j.acm.20160501.11

    Copy | Download

  • @article{10.11648/j.acm.20160501.11,
      author = {Geleta Tadele Mohammed},
      title = {New Algorithm for N-jobs on M-machine Flow Shop Scheduling Problems},
      journal = {Applied and Computational Mathematics},
      volume = {5},
      number = {1},
      pages = {1-9},
      doi = {10.11648/j.acm.20160501.11},
      url = {https://doi.org/10.11648/j.acm.20160501.11},
      eprint = {https://article.sciencepublishinggroup.com/pdf/10.11648.j.acm.20160501.11},
      abstract = {Because of flow shop scheduling is one of the most important problems in the area of production management, In this paper, what I have did is that, I have developed a new algorithm for n-jobs m-machine flow shop scheduling problem for special case of n-jobs m-machine flow shop scheduling problem. And also, there is a good self explanatory example to explain the algorithm very well.},
     year = {2016}
    }
    

    Copy | Download

  • TY  - JOUR
    T1  - New Algorithm for N-jobs on M-machine Flow Shop Scheduling Problems
    AU  - Geleta Tadele Mohammed
    Y1  - 2016/01/15
    PY  - 2016
    N1  - https://doi.org/10.11648/j.acm.20160501.11
    DO  - 10.11648/j.acm.20160501.11
    T2  - Applied and Computational Mathematics
    JF  - Applied and Computational Mathematics
    JO  - Applied and Computational Mathematics
    SP  - 1
    EP  - 9
    PB  - Science Publishing Group
    SN  - 2328-5613
    UR  - https://doi.org/10.11648/j.acm.20160501.11
    AB  - Because of flow shop scheduling is one of the most important problems in the area of production management, In this paper, what I have did is that, I have developed a new algorithm for n-jobs m-machine flow shop scheduling problem for special case of n-jobs m-machine flow shop scheduling problem. And also, there is a good self explanatory example to explain the algorithm very well.
    VL  - 5
    IS  - 1
    ER  - 

    Copy | Download

Author Information
  • Department of Mathematics, College of Natural Sciences, Arba Minch University, Arba MInch, Ethiopia

  • Sections