A memetic algorithm-based heuristic for a scheduling problem in printed circuit board assembly |
| |
| Authors: | Patcharaporn Neammanee Manop Reodecha |
| |
| Affiliation: | 1. School of Applied Statistics, National Institute of Development Administration (NIDA), Serithai Road, Bangkaphi, Bangkok 10240, Thailand;2. Industrial Engineering Department, Engineering Faculty, Chulalongkorn University, Bangkok 10400, Thailand;1. School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran;2. Department of Econometrics & Operations Research, Tilburg University, Tilburg, The Netherlands;1. State Key Laboratory of Synthetical Automation for Process Industries, Northeastern University, Shenyang 110819, China;2. College of Computer Science, Liaocheng University, Liaocheng 252059, China;3. Tsinghua National Laboratory for Information Science and Technology (TNList), Department of Automation, Tsinghua University, Beijing 100084, China |
| |
| Abstract: | This research develops a memetic algorithm to solve Printed Circuit Board (PCB) scheduling with sequence-dependent setup times on a single machine with constrained feeder capacity. The objective of the scheduling problem is to minimize the total weighted tardiness. A memetic algorithm-based heuristics is developed by integrating a genetic algorithm, Minimum Slack Time (MST) scheduling rule, “Keep Tool Needed Soonest” (KTNS) policy, and a local search procedure. Application of the MA results in two outcome plans: a scheduling plan and a feeder setup plan.Numerical experiments show that compared to a number of commonly used dispatching rules, the memetic algorithm provides better solutions in term of minimum total weighted tardiness. Even the computation is the highest, it still practical. Calibration of MA parameter values is also explored in this study. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
