Bi-objective Scheduling for Reentrant Hybrid Flow Shop: Application to a TFT-LCD Manufacturing

Abstract

This article proposes local search based pareto genetic algorithms to solve the biobjective scheduling problem to minimize makespan and total tardiness for a reentrant hybrid flowshop. The pareto genetic algorithms are compared with existing dispatching rules under a variety of experimental conditions. We also compare the performance of the proposed genetic algorithms with that of a commercial scheduling software based on real scheduling data provided by a TFTLCD factory in Korea.