Scheduling for a flow shop with waiting time constraints and missing operations in semiconductor manufacturing

Citations

WEB OF SCIENCE

21
Citations

SCOPUS

23

초록

Semiconductor manufacturing systems consist of highly complex and constrained processes owing to the requirement for high-quality wafers and dynamic customer orders. This study focuses on waiting time constraints to achieve high-quality wafers, with missing operations, to manufacture different types of orders, which are common scheduling requirements in semiconductor manufacturing systems. Waiting time constraints limit the waiting times between consecutive machines. Although sequential steps are modelled as a flow shop, some jobs can skip some steps in the flow shop. Such jobs can accordingly skip certain machines in the flow shop, which is called 'missing operations'. This research investigates a scheduling problem for a flow shop with waiting time constraints and missing operations. A mathematical programming formulation and scheduling algorithms are proposed to operate such a flow shop efficiently. Through computational experiments, the proposed algorithms were evaluated, and analysis of various parameters for waiting time constraints and missing operations was conducted.

키워드

Schedulingflow shopsemiconductor manufacturingwaiting time constraintsmissing operationsheuristic algorithmITERATED GREEDY ALGORITHMPERMUTATION FLOWSHOP2-MACHINE FLOWSHOPMEAN TARDINESSMINIMIZATIONMAKESPANHEURISTICSDESIGN
제목
Scheduling for a flow shop with waiting time constraints and missing operations in semiconductor manufacturing
저자
Han, Jun-HeeLee, Ju-Yong
DOI
10.1080/0305215X.2022.2124406
발행일
2023-10-03
유형
Article
저널명
Engineering Optimization
55
10
페이지
1742 ~ 1759