Combined scheduling algorithm for re-entrant batch-processing machines in semiconductor wafer manufacturing

In this paper, a new combined scheduling algorithm is proposed to address the problem of minimising total weighted tardiness on re-entrant batch-processing machines (RBPMs) with incompatible job families in the semiconductor wafer fabrication system (SWFS). The general combined scheduling algorithm...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:International journal of production research Ročník 53; číslo 6; s. 1866 - 1879
Hlavní autoři: Jia, Wenyou, Jiang, Zhibin, Li, You
Médium: Journal Article
Jazyk:angličtina
Vydáno: London Taylor & Francis 19.03.2015
Taylor & Francis LLC
Témata:
Algorithms
batch-oriented combined scheduling algorithm
Effectiveness studies
family-oriented combined scheduling algorithm
Integer programming
Linear programming
Mathematical models
Mixed integer
Operations research
Platforms
Production scheduling
re-entrant batch-processing machine
rolling horizon control strategy
Scheduling
Scheduling algorithms
Semiconductors
Simulation
Strategy
Wafers
ISSN:0020-7543, 1366-588X
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this paper, a new combined scheduling algorithm is proposed to address the problem of minimising total weighted tardiness on re-entrant batch-processing machines (RBPMs) with incompatible job families in the semiconductor wafer fabrication system (SWFS). The general combined scheduling algorithm forms batches according to parameters from the real-time scheduling simulation platform (ReS 2 ), and then sequences batches through slack-based mixed integer linear programming model (S-MILP), which is defined as batch-oriented combined scheduling algorithm. The new combined scheduling algorithm obtains families' parameters from ReS 2 and then sequences these families through modified S-MILP, which is defined as family-oriented combined scheduling algorithm. With rolling horizon control strategy, two combined scheduling algorithms can update RBPMs scheduling continually. The experiments are implemented on ReS 2 of SWFS and ILOG CPLEX, respectively. The results demonstrate the effectiveness of our proposed methods.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0020-7543
1366-588X
DOI:10.1080/00207543.2014.965355