Flow Shop Scheduling Problem of Minimizing Makespan with Bounded Processing Parameters
- 22 Downloads
A three-machine flow shop scheduling problem of minimum makespan is addressed in this paper. The setup time and transportation time are considered as independent parameters of processing. Further, setup time, processing time and transportation time are considered to be stochastic rather than deterministic. It is observed that the actual value of these cannot be estimated in advance unless the processing of jobs is completed on each of the available machines and only prior information of lower and upper bounds is available. Since the exact value of the time required is not known in advance, there may not exist a unique optimal schedule of jobs. Therefore, it is desired to obtain the set of all dominating schedules and reduce the cardinality of solution set. To meet the claimed objective, the local and global dominance relations have been developed and the use of these relations is represented by numerical illustration.
KeywordsFlow shop scheduling Dominance relation Bounded processing time Bounded setup and transportation time Makespan
One of authors (Meenakshi Sharma) acknowledges the financial support provided by council of scientific and industrial research, New Delhi, India, in the form of SRF through grant number 09/135(0766)/2017-EMR-I.
- 1.S. Aggarwal, A. Gautam, D.K. Chauhan, L.M. Tiwari, S. Kapoor, A flow shop scheduling problem with transportation time and separated setup time of jobs. Procedia Eng. 38, 1327–1332 (2012)Google Scholar
- 3.A. Allahverdi, Three-machine flowshop scheduling problem to minimize total completion time with bounded setup and processing times. Decis. Mak. Manuf. Serv. 1(1–2), 5–23 (2017)Google Scholar
- 6.P.C. Bagga, K. Khurana, Two-machine flowshop with separated sequence-independent setup times: mean completion time criterion. Indian J. Manag. Syst. 2, 47–57 (1986)Google Scholar
- 7.A.B. Chandramauli, Heuristic approach for n-job 3 machine flow shop scheduling problem involving transportation time, breakdown and weights of jobs. Math. Comput. Appl. 10(2), 301–305 (2005)Google Scholar
- 11.D. Gupta, S. Sharma, S. Sharma, Heuristic approach for n-jobs, 3-machines flow shop scheduling problem, processing time associated with probabilities involving transportation time, break-down interval, weightage of jobs and job block criteria. Math. Theory Model. 1(1), 30–36 (2011)Google Scholar
- 15.P.L. Maggu, G. Das, Elements of Advanced Production Scheduling (UPPD, New Delhi, 1980)Google Scholar
- 16.A. Mittal, S. Agarwal, S. Prasad, S.R. Ansari, Heuristic approach for n jobs, 3 machines flow shop scheduling problem involving transportation time, equivalent job block, weight of jobs and break down internval. Int. J. Appl. Math. Appl. 3(1), 77–84 (2011)Google Scholar
- 17.M. Nawaz, E.E. Enscore, I. Ham, A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega. 11(1), 91–95 (1983)Google Scholar
- 18.C. Rajendran, H. Ziegler, Ant colony algorithms for permutation flow shop scheduling to minimize makespan/ total flowtime of jobs. Eur. j. op. Res. 155(2), 426–438 (2004)Google Scholar
- 19.R. Ruiz, T. Stutzle. An iterated greedy algorithm for permutation flow shop scheduling problem. Eur. J. Oper. Res. 177(3), 2033-2049 (2007)Google Scholar
- 22.K.C. Ying, S.-W. Lin, A high-performing constructive heuristic for minimizing makespan in permutation flowshops. Int. J. Product. Ind. Eng. 36(6), 355–362 (2014)Google Scholar