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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
