Volume 5, Issue 1, February 2016, Page: 1-9
New Algorithm for N-jobs on M-machine Flow Shop Scheduling Problems
Geleta Tadele Mohammed, Department of Mathematics, College of Natural Sciences, Arba Minch University, Arba MInch, Ethiopia
Received: Nov. 13, 2015;       Accepted: Nov. 24, 2015;       Published: Jan. 15, 2016
DOI: 10.11648/j.acm.20160501.11      View  4653      Downloads  141
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.
Keywords
N-jobs M-machine, Flow Shop Scheduling Problems
To cite this article
Geleta Tadele Mohammed, New Algorithm for N-jobs on M-machine Flow Shop Scheduling Problems, Applied and Computational Mathematics. Vol. 5, No. 1, 2016, pp. 1-9. doi: 10.11648/j.acm.20160501.11
Copyright
Copyright © 2016 Authors retain the copyright of this article.
This article is an open access article distributed under the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0/) which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Reference
[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.
Browse journals by subject