期刊
COMPUTERS & INDUSTRIAL ENGINEERING
卷 56, 期 1, 页码 294-305出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2008.06.010
关键词
Memetic algorithm; Genetic algorithm; PCB scheduling; Sequence-dependent setup times
资金
- The Thailand Research Fund (TRF)
- Commission on Higher Education [MRG4580040]
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. Crown copyright (C) 2008 Published by Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据