|
Application of Heuristics for Scheduling Problem Hard Disk Drive Manufacturing |
|---|---|
| รหัสดีโอไอ | |
| Creator | 1. Pinrada Pinthongkum 2. Wuthichai Wongthatsanekorn |
| Title | Application of Heuristics for Scheduling Problem Hard Disk Drive Manufacturing |
| Publisher | Faculty of Engineering, Khon Kaen Univeristy |
| Publication Year | 2555 |
| Journal Title | KKU Engineering Journal |
| Journal Vol. | 39 |
| Journal No. | 2 |
| Page no. | 173-197 |
| Keyword | Makespan, Firefly Algorithm,Unrelated parallel machine Scheduling problem |
| ISSN | 0125-8573 |
| Abstract | The challenge in unrelated parallel machine scheduling problem of hard disk drive (HDD) industry is to determine the optimal job sequence that minimizes the makespan. Each job can be performed by more than one machine and each machine has different capacity. This research offers the methodology for solving the unrelated parallel machine scheduling to optimize the makespan and tardiness. This problem is very difficult to solve by conventional mathematical programming. Hence, this research applies Firefly Algorithm to solve the problem. The experiment was conducted to find the suitable parameters for the scheduling problem based on past studies. In addition, two enhancement techniques which are swap operator and adjustment operator are studied to improve the performance of FA. The results show that nG should be set to 100*25, ? to 0.1, ?0 to 1 and ?0 to 1, respectively. Also, SO method yield slightly better makespan than the AO method for solving the medium and large size problems. When the results are compared with the original method, the proposed method could solve the case study problem with less computational effort. |
