Journal
COMPUTERS & INDUSTRIAL ENGINEERING
Volume 56, Issue 1, Pages 294-305Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2008.06.010
Keywords
Memetic algorithm; Genetic algorithm; PCB scheduling; Sequence-dependent setup times
Funding
- The Thailand Research Fund (TRF)
- Commission on Higher Education [MRG4580040]
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available