Voir la notice de l'article provenant de la source Numdam
In this paper, we study an earliness–tardiness scheduling problem for a single machine that is motivated by process conditions found in semiconductor wafer fabrication facilities (wafer fabs). In modern 300-mm wafer fabs, front opening unified pods (FOUPs) transfer wafers. The number of FOUPs is limited to avoid a congestion of the Automated Material Handling System. Several orders can be grouped in one FOUP. A nonrestrictive common due date for all the orders is assumed. Only orders that belong to the same family can be processed together in a single FOUP at the same time. We present a Mixed Integer Linear Programming (MILP) formulation for this problem. Moreover, we show that this scheduling problem is NP-hard. We propose several simple heuristics based on dispatching rules and assignment strategies from bin packing. Moreover, genetic algorithms are designed that assign the orders to the set of early and tardy orders, respectively. In addition, a random key genetic algorithm (RKGA) is described that proposes order sequences. The different algorithms are hybridized with job formation and sequencing heuristics. A more specialized algorithm that is based on the generalized assignment problem is presented for the special case of a single order family. Results of computational experiments based on randomly generated problem instances are presented. They demonstrate that the genetic algorithms perform well with respect to solution quality and computing time under a broad range of experimental conditions.
Rocholl, Jens 1 ; Mönch, Lars 1
@article{RO_2018__52_4-5_1329_0,
author = {Rocholl, Jens and M\"onch, Lars},
title = {Hybrid algorithms for the earliness{\textendash}tardiness single-machine multiple orders per job scheduling problem with a common due date},
journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
pages = {1329--1350},
publisher = {EDP-Sciences},
volume = {52},
number = {4-5},
year = {2018},
doi = {10.1051/ro/2018029},
mrnumber = {3884164},
zbl = {1411.90084},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.1051/ro/2018029/}
}
TY - JOUR AU - Rocholl, Jens AU - Mönch, Lars TI - Hybrid algorithms for the earliness–tardiness single-machine multiple orders per job scheduling problem with a common due date JO - RAIRO - Operations Research - Recherche Opérationnelle PY - 2018 SP - 1329 EP - 1350 VL - 52 IS - 4-5 PB - EDP-Sciences UR - http://geodesic.mathdoc.fr/articles/10.1051/ro/2018029/ DO - 10.1051/ro/2018029 LA - en ID - RO_2018__52_4-5_1329_0 ER -
%0 Journal Article %A Rocholl, Jens %A Mönch, Lars %T Hybrid algorithms for the earliness–tardiness single-machine multiple orders per job scheduling problem with a common due date %J RAIRO - Operations Research - Recherche Opérationnelle %D 2018 %P 1329-1350 %V 52 %N 4-5 %I EDP-Sciences %U http://geodesic.mathdoc.fr/articles/10.1051/ro/2018029/ %R 10.1051/ro/2018029 %G en %F RO_2018__52_4-5_1329_0
Rocholl, Jens; Mönch, Lars. Hybrid algorithms for the earliness–tardiness single-machine multiple orders per job scheduling problem with a common due date. RAIRO - Operations Research - Recherche Opérationnelle, Tome 52 (2018) no. 4-5, pp. 1329-1350. doi: 10.1051/ro/2018029
Cité par Sources :