Two Stage Flow Shop Scheduling Model Including Transportation Time with Equipotential Machines at Every Stage
Deepak Gupta1, Sonia Goel2
1Deepak Gupta, Professor, Department of Mathematics, M. M. (Deemed to be University), Mullana (Ambala) Haryana, India.
2Sonia Goel, Research Scholar, Department of Mathematics, M. M. (Deemed to be University), Mullana (Ambala) Haryana, India.
Manuscript received on September 16, 2019. | Revised Manuscript received on 24 September, 2019. | Manuscript published on October 10, 2019. | PP: 5090-5094 | Volume-8 Issue-12, October 2019. | Retrieval Number: L27401081219/2019©BEIESP | DOI: 10.35940/ijitee.L2740.1081219
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: This study presents a solution algorithm for the problem of minimizing the makespan on equipotential parallel machines at every stage in two stage flow shop scheduling model. The processing time of all the jobs on all the two machines is given and the time for which parallel equipotential machines are available is also given. Transportation time for moving the jobs from first machine to second machine is also taken into consideration. A mathematical illustration is also given in support of the algorithm proposed.
Keywords: Scheduling, Elapsed Time, Equipotential Machines, Operating Cost, Transportation Time
Scope of the Article: Transportation Engineering