Minimizing Makespan in Three Phase Flowshop Scheduling Problems with Multiple Processor at Level First

Abstract

This paper indicates the investigation of most efficient use of limited resources in production industries. Here the study provides a sequence of steps for solving the problems with three phase flowshop scheduling with equi-potential machines with the processing time accepted as Triangular Fuzzy numbers, with each machine having different operating cost.

Objectives:

The motivation behind this study is to find ideal or near ideal solution for solving the three-stage scheduling problem in fuzzy environment and making the best or most effective use of time and money.

Methods:

Here the methodology Branch and Bound is stacked up  with the Genetic algorithm and Gupta’s heuristic method. In our study we evaluated the technique of finding  step by step process for solving the three-stage  scheduling problem with processing time accepted as triangular fuzzy number at each stage . Various parameters like transportation time in between machines, no-idle time, job block etc. can be extended work for this study.

Conclusion:

 In this study the point that should be observed that the Branch and Bound gave the makespan 139 but on the other hand by genetic algorithm the make span is different according to different iteration . It may happen that by chance, at any one iteration genetic algorithm gives more optimum solution ,but this will not possible always. Also, Gupta’s Heuristic does not guarantee the optimum solution but prioritizes jobs based on the balanced between stages .This is useful when there is no need to minimum makespan but ensuring a smooth flow across the multiple stages.