A hybrid genetic algorithm for parallel machine scheduling at semiconductor back-end production

6Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

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.

Cite

CITATION STYLE

APA

Adan, J., Akcay, A., Stokkermans, J., & Van den Dobbelsteen, R. (2018). A hybrid genetic algorithm for parallel machine scheduling at semiconductor back-end production. In Proceedings International Conference on Automated Planning and Scheduling, ICAPS (Vol. 2018-June, pp. 298–302). Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/icaps.v28i1.13913

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free