Logo image
Hybrid Genetic Algorithms for Solving Reentrant Flow-Shop Scheduling with Time Windows
期刊文章   同儕審查

Hybrid Genetic Algorithms for Solving Reentrant Flow-Shop Scheduling with Time Windows

C. Chamnanlor, K. Sethanan, Chen-Fu ChienM. Gen
Industrial Engineering & Management Systems Industrial Engineering & Management Systems, 卷.12(4), 頁碼.306-316
2013

摘要

The semiconductor industry has grown rapidly, and subsequently production planning problems have raised many important research issues. The reentrant flow-shop (RFS) scheduling problem with time windows constraint for harddisk devices (HDD) manufacturing is one such problem of the expanded semiconductor industry. The RFS scheduling problem with the objective of minimizing the makespan of jobs is considered. Meeting this objective is directly related to maximizing the system throughput which is the most important of HDD industry requirements. Moreover, most manufacturing systems have to handle the quality of semiconductor material. The time windows constraint in the manufacturing system must then be considered. In this paper, we propose a hybrid genetic algorithm (HGA) for improving chromosomes/offspring by checking and repairing time window constraint and improving offspring by left-shift routines as a local search algorithm to solve effectively the RFS scheduling problem with time windows constraint. Numerical experiments on several problems show that the proposed HGA approach has higher search capability to improve quality of solutions.

相關連結

指標

1 檢視次數

詳細資料

Logo image