Minimizing Hiring Cost of the Machine Under No Idle Constraints in N*2 Flow Shop Scheduling with Transportation and Set Up Time
Deepak Gupta1, Richa Goel2
1Dr. Deepak Gupta*, Head and Professor, Mathematics Department, Maharishi Markandeshwar Engineering college, Maharishi Markandeshwar (Deemed to be University), Mullana (Ambala) Haryana, India.
2Richa Goel, Research Scholar, Maharishi Markandeshwar Engineering college, Maharishi Markandeshwar (Deemed to be University), Mullana (Ambala) Haryana, India.
Manuscript received on November 12, 2019. | Revised Manuscript received on 23 November, 2019. | Manuscript published on December 10, 2019. | PP: 5227-5229 | Volume-9 Issue-2, December 2019. | Retrieval Number: B7565129219/2019©BEIESP | DOI: 10.35940/ijitee.B7565.129219
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: The present paper deals with a problem of n*2 flow shop scheduling where setup time of the machines are separated from their dispensation time and transportation time for moving from first machine to second machine is also given. Our aim is to get the most favorable jobs sequence which can make machines idle time equal to zero so that rental cost can be minimized. In order to ensure no idle constraint, we have developed an algorithm in which we have delayed the start time of machine B, so that machine B works continuously without any idle time. A simple mathematical example is also given to clear the concept.
Keywords: Elapsed Time, Flow Shop, Hiring Cost, Idle Time, Set up Time, Transportation Time.
Scope of the Article: Transportation Engineering