In this paper we have developed an algorithm for n-jobs with m-machine flow shop scheduling problems in order to handle variety of data type than Geleta [3]. In other hands, as in Geleta [3] it main objective is how to obtain optimal sequence of jobs with aim of minimum squared value of lateness.
| Published in | Applied and Computational Mathematics (Volume 6, Issue 2) |
| DOI | 10.11648/j.acm.20170602.14 |
| Page(s) | 88-92 |
| 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), 2017. Published by Science Publishing Group |
N-jobs M-machine Flow Shop Scheduling Problems, Squared Lateness, Completion Time and Processing Time Multiple
| [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] | Geleta Tadele Mohammed. New Algorithm for N-jobs on M-machine Flow Shop Scheduling Problems. Applied and Computational Mathematics Journal. Vol. 5, No. 1, 2016, pp. 1-9. doi: 10.11648/j.acm.20160501.11 |
| [4] | Johnson, S. M. “Optimal two and three stage production schedules with setup times included.” Naval Research Logistics Quarterly, Vol I, 61-68, 1954. |
| [5] | [5]Jackson, J.R.,” An extension of Johnson’s results on lot scheduling”, Naval Research Logistics Quarterly, Vol 3, pp.201-2003, 1956. |
| [6] | Ibrahim, M. A., “Algorithms for Sequencing and Scheduling,” Industrial Engineering Department, College of Engineering, King saud University, Riyadh, Saudi Arabia. |
| [7] | 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. |
| [8] | Taylor, F.W., “Shop Management”, Harper and Bros, New York, 1911. |
| [9] | Herrmann, Jeffrey. W “A history of production Scheduling” in Handbook of Production Scheduling, Springer, New York, 2006. |
| [10] | 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. |
| [11] | Conway, R.W., Maxwell, W.L., and Miller, L.W.” Theory of Scheduling,” Addison-Wesley Publishing Company, Massachusetts, 1967. |
| [12] | Miloš Šeda “Mathematical Models of Flow Shop and Job Shop Scheduling Problems”, International Journal of Applied Mathematics and Computer Sciences Volume 4 Number 4. |
| [13] | Kerem Bülbü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. |
APA Style
Geleta Tadele Mohammed. (2017). Special Case Algorithm for N-jobs M-machines Flow Shop Scheduling Problems. Applied and Computational Mathematics, 6(2), 88-92. https://doi.org/10.11648/j.acm.20170602.14
ACS Style
Geleta Tadele Mohammed. Special Case Algorithm for N-jobs M-machines Flow Shop Scheduling Problems. Appl. Comput. Math. 2017, 6(2), 88-92. doi: 10.11648/j.acm.20170602.14
AMA Style
Geleta Tadele Mohammed. Special Case Algorithm for N-jobs M-machines Flow Shop Scheduling Problems. Appl Comput Math. 2017;6(2):88-92. doi: 10.11648/j.acm.20170602.14
Share This Article
Twitter
Linked In
Facebook
Copy
Download@article{10.11648/j.acm.20170602.14,
author = {Geleta Tadele Mohammed},
title = {Special Case Algorithm for N-jobs M-machines Flow Shop Scheduling Problems},
journal = {Applied and Computational Mathematics},
volume = {6},
number = {2},
pages = {88-92},
doi = {10.11648/j.acm.20170602.14},
url = {https://doi.org/10.11648/j.acm.20170602.14},
eprint = {https://article.sciencepublishinggroup.com/pdf/10.11648.j.acm.20170602.14},
abstract = {In this paper we have developed an algorithm for n-jobs with m-machine flow shop scheduling problems in order to handle variety of data type than Geleta [3]. In other hands, as in Geleta [3] it main objective is how to obtain optimal sequence of jobs with aim of minimum squared value of lateness.},
year = {2017}
}
TY - JOUR T1 - Special Case Algorithm for N-jobs M-machines Flow Shop Scheduling Problems AU - Geleta Tadele Mohammed Y1 - 2017/04/07 PY - 2017 N1 - https://doi.org/10.11648/j.acm.20170602.14 DO - 10.11648/j.acm.20170602.14 T2 - Applied and Computational Mathematics JF - Applied and Computational Mathematics JO - Applied and Computational Mathematics SP - 88 EP - 92 PB - Science Publishing Group SN - 2328-5613 UR - https://doi.org/10.11648/j.acm.20170602.14 AB - In this paper we have developed an algorithm for n-jobs with m-machine flow shop scheduling problems in order to handle variety of data type than Geleta [3]. In other hands, as in Geleta [3] it main objective is how to obtain optimal sequence of jobs with aim of minimum squared value of lateness. VL - 6 IS - 2 ER -
Email: