A Memetic Algorithm to Solve an Unrelated Parallel Machine Scheduling Problem with Auxiliary Resources in Semiconductor Manufacturing

Abstract : In this paper, we propose a metaheuristic for solving an original scheduling problem with auxiliary resources in a photolithography workshop of a semiconductor plant. The photolithography workshop is often a bottleneck, and improving scheduling decisions in this workshop can help to improve indicators of the whole plant. Two optimization criteria are separately considered: the weighted flow time (to minimize) and the number of products that are processed (to maximize). After stating the problem and giving some properties on the solution space, we show how these properties help us to efficiently solve the problem with the proposed memetic algorithm, which has been implemented and tested on large generated instances. Numerical experiments show that good solutions are obtained within a reasonable computational time.
Type de document :
Article dans une revue
Journal of Scheduling, Springer Verlag, 2016, 19 (4), pp.367-376. 〈10.1007/s10951-014-0397-6〉
Liste complète des métadonnées

https://hal-emse.ccsd.cnrs.fr/emse-01555622
Contributeur : Stéphane Dauzère-Pérès <>
Soumis le : mardi 4 juillet 2017 - 12:00:07
Dernière modification le : lundi 17 juillet 2017 - 12:22:03

Identifiants

Collections

Citation

Abdoul Bitar, Stéphane Dauzere-Peres, Claude Yugma, Renaud Roussel. A Memetic Algorithm to Solve an Unrelated Parallel Machine Scheduling Problem with Auxiliary Resources in Semiconductor Manufacturing. Journal of Scheduling, Springer Verlag, 2016, 19 (4), pp.367-376. 〈10.1007/s10951-014-0397-6〉. 〈emse-01555622〉

Partager

Métriques

Consultations de la notice

31