International Journal of Industrial Engineering & Production Research

Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

---

In this paper the problem of serial batch scheduling in a two-stage hybrid flow shop environment with minimizing Makesapn is studied. In serial batching it is assumed that jobs in a batch are processed serially, and their completion time is defined to be equal to the finishing time of the last job in the batch. The analysis and implementation of the prohibited transference of jobs among the machines of stage one in serial batch is the main contribution of this study. Machine set-up and ready time for all jobs are assumed to be zero and no Preemption is allowed. Machines may not breakdown but at times they may be idle. As the problem is NP-hard, a genetic algorithm is developed to give near optimal solutions. Since this problem has not been studied previously, therefore, a lower bound is developed for evaluating the performance of the proposed GA. Many test problems have been solved using GA and results compared with lower bound. Results showed GA can obtain a near optimal solution for small, median and large size problems in reasonable time.

Keywords: scheduling, hybrid flowshop, serial batching, genetic algorithm, taguchi method

Full-Text [PDF 1107 kb]   (3839 Downloads)    

Add your comments about this article : Your username or Email:

---

---