Two Stage Flow Shop Scheduling Problem with Involving Transportation Time for Job Blocks in Fuzzy Environment Ambika G.*, Dr. Uthra G.** *Assistant Professor, SKR Engineering College, Department of Mathematics, Chennai, India **Assistant Professor, Pachaiyappa's College, Department of Mathematics, Chennai, India Online published on 14 October, 2016. Abstract This paper consists of afuzzy flow shop scheduling problem whose objective is to minimize the total elapsed timeof jobs involvingjob block. The processing time setup time and transportation time are taken as triangular fuzzy numbers which are defuzzified into crisp ones by Yager's method. The optimal sequence is found by Johnson's algorithm and the minimum totalelapsed time is found. The approach is illustrated by a numerical example. Top Keywords Transportation time, Job blocks, Optimal sequence, Total elapsed time. Top |
|
Access denied
Your current subscription does not entitle you to view this content or Abstract is unavailable, the access to full-text of this Article/Journal has been denied. For Information regarding subscription please click here.
For a comprehensive list of other publications available on IJour.net please click here
or, You can subscribe other items from IJour.net (Click here to see other items list.)
Top