.png){kind=icon}
返回
Semiconductor final-test scheduling under setup operator constraints
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2021.105619.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Scheduling
Flexible job shop
Semiconductor
Tabu search
Simulated annealing
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
Joint Latent Class Model for Longitudinal Data and Interval-Censored Semi-Competing Events: Application to Dementia.png)
Biometrics
OAAI
BiometricsIF0
OAAI分享收藏
Hybrid artificial bee colony algorithm with a rescheduling strategy for solving flexible job shop scheduling problems带有重新调度策略的混合人工蜂群算法求解柔性作业车间调度问题
PREAI
分享收藏
查看更多内容