A Hybrid Genetic Algorithm for Parallel Machine Scheduling at Semiconductor Back-End Production

Authors

  • Jelle Adan Eindhoven University of Technology, Nexperia
  • Ivo Adan Eindhoven University of Technology
  • Alp Akcay Eindhoven University of Technology
  • Rick Van den Dobbelsteen Nexperia
  • Joep Stokkermans Nexperia

DOI:

https://doi.org/10.1609/icaps.v28i1.13913

Keywords:

Scheduling, Parallel Machines, Genetic Algorithm, Semiconductor

Abstract

This paper addresses batch scheduling at a back-end semiconductor plant of Nexperia. This complex manufacturing environment is characterized by a large product and batch size variety, numerous parallel machines with large capacity differences, sequence and machine dependent setup times and machine eligibility constraints. A hybrid genetic algorithm is proposed to improve the scheduling process, the main features of which are a local search enhanced crossover mechanism, two additional fast local search procedures and a user-controlled multi-objective fitness function. Testing with real-life production data shows that this multi-objective approach can strike the desired balance between production time, setup time and tardiness, yielding high-quality practically feasible production schedules.

Downloads

Published

2018-06-15

How to Cite

Adan, J., Adan, I., Akcay, A., Van den Dobbelsteen, R., & Stokkermans, J. (2018). A Hybrid Genetic Algorithm for Parallel Machine Scheduling at Semiconductor Back-End Production. Proceedings of the International Conference on Automated Planning and Scheduling, 28(1), 298-302. https://doi.org/10.1609/icaps.v28i1.13913