Open AccessMinimizing Hiring Cost of the Machine Under No Idle Constraints in N*2 Flow Shop Scheduling with Transportation and Set Up Time.
Author(s) -
Deepak Gupta*,
Richa Goel
Publication year - 2019
Publication title -
international journal of innovative technology and exploring engineering
Language(s) - English
Resource type - Journals
ISSN - 2278-3075
DOI - 10.35940/ijitee.b7565.129219
Subject(s) - idle , flow shop scheduling , renting , computer science , scheduling (production processes) , mathematical optimization , set (abstract data type) , real time computing , job shop scheduling , engineering , schedule , mathematics , operating system , civil engineering , programming language
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.