.png){kind=icon}
Return
Semiconductor final-test scheduling under setup operator constraints
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2021.105619.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We consider a semiconductor final-test scheduling problem that aims at minimizing the total weighted tardiness. In contrast to previous studies on this problem, we explicitly take account of the need to assign human operators to setup operations. We present decomposition-based heuristic solution approaches and a mixed integer program. In a computational study based on real-world problem instances that mimic settings at our industry partner, we show that our heuristics clearly outperform a standard solver when computational time is limited. Based on this result, we provide decision support for managers by analyzing the capability and effect of rescheduling jobs in the presence of a highly dynamic environment with frequently changing customer requests and common test machine failures.
Keywords:
Scheduling
Flexible job shop
Semiconductor
Tabu search
Simulated annealing
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W
Organization
Cited Papers
Joint Latent Class Model for Longitudinal Data and Interval-Censored Semi-Competing Events: Application to Dementia.png)
Biometrics
OAAI
BiometricsIF0
OAAIShareSave
ShareSaveShareSave
View more