Heuristic Approach For N- Job 3- Machine Weighted Flow Shop Scheduling Problem Involving break Down Time
Keywords:
Heuristic Approach, Break down time, flow shop schedulingAbstract
The present paper studies break down concept in especially N job 3 machine flow shop scheduling in which processing times are associated with weight of the job. The objective of the study is to get optimal or near optimal sequence of jobs in order to minimize the total weighted mean production flow time of the jobs. The algorithm is made clear by numerical example.
Downloads
References
Johnson.S.M. Optimal two and three stage production schedules with setup time included., Naval Research Logistics Quartly1(1954) 61-68
Jackson, JR. (1956) ‘An extension of Johnson’s results on job lot scheduling’, Naval Research logistics Quarterly, Vol.3, pp.201-203.
Maggu, PL. and Das, G. (1980) ‘on 2xn sequencing with transportation times of jobs’, Pure and Applied Mathematika Science, Vol.12, pp.1- 6.
A.B.Chandramouli., Heuristic approach for N job 3 machine flow shop scheduling problem involving transportation time, Breakdown times and Weightage of jobs., Mathematical and Computer application vol 10 pp.301-305,2005.
Mittten, LG. (1959) ‘Sequencing n jobs on two machines with arbitrary time lags’, Management Science , Vol.5, No.3, pp.293-298.
Maggu, PL., Singhal, ML., Mohammad, N., and Yadav, SK. (1982) ‘On n-job, 2-machine flow-shop scheduling problem with arbitrary time lags and transportation times of jobs’, Journal of the Operations Research Society of Japan, Vol.25, pp.219-227.
P. Pandian and P. Rajendran., Solving Constrained Flow-Shop Scheduling Problems with Three Machines, Int. J. Contemp. Math. Sciences, Vol. 5, 2010, no. 19, 921 – 929.
Downloads
Published
Issue
Section
License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
