Special Case Algorithm for N-jobs M-machines Flow Shop Scheduling Problems
Applied and Computational Mathematics
Volume 6, Issue 2, April 2017, Pages: 88-92
Received: Feb. 10, 2016; Accepted: Dec. 29, 2016; Published: Apr. 7, 2017
Views 2060      Downloads 118
Author
Geleta Tadele Mohammed, Department of Mathematics, College of Natural Sciences, Arba Minch University, Arba Minch, Ethiopia
Article Tools
Follow on us
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.
Keywords
N-jobs M-machine Flow Shop Scheduling Problems, Squared Lateness, Completion Time and Processing Time Multiple
To cite this article
Geleta Tadele Mohammed, Special Case Algorithm for N-jobs M-machines Flow Shop Scheduling Problems, Applied and Computational Mathematics. Vol. 6, No. 2, 2017, pp. 88-92. doi: 10.11648/j.acm.20170602.14
Copyright
Copyright © 2017 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.
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]
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.
ADDRESS
Science Publishing Group
1 Rockefeller Plaza,
10th and 11th Floors,
New York, NY 10020
U.S.A.
Tel: (001)347-983-5186