TY - JOUR
T1 - Self-growth learning-based machine scheduler to minimize setup time and tardiness in OLED display semiconductor manufacturing
AU - Lee, Donghun
AU - Lee, Dongjin
AU - Kim, Kwanho
N1 - Publisher Copyright:
© 2023 Elsevier B.V.
PY - 2023/9
Y1 - 2023/9
N2 - This paper focuses on a scheduling problem of the evaporation and encapsulation (EVEN) line in organic light-emitting diode (OLED) display manufacturing towards minimizing total setup time and tardiness of allocated jobs. This scheduling problem is an unrelated dedicated parallel machine scheduling (UDPMS) problem with practical complex constraints including machine availability, family setup, preventive maintenance (PM), and job splitting. There are three major points to this problem. First, the processing of a job on a machine should be completed before its due date. Second, setups should be reduced to minimize labor costs. Finally, a job is able to be split into one or more sub-jobs for processing on machines independently. To obtain a schedule to minimize total setup time and tardiness of allocated jobs, we suggest two novel machine schedulers such as deep learning-based and self-growth learning-based schedulers, called DLS and SGLS, respectively. Although the structure of the proposed schedulers is identical, especially, SGLS incrementally learns to explore more effective allocation patterns by preserving the obtained knowledge from the trained DLS based on self-growth learning. The comprehensive experiments show that SGLS produces satisfactory schedules in terms of minimizing total setup time and tardiness. In particular, when the number of jobs and the ratio of job sizes are larger, SGLS achieves a schedule with both less setup time and tardiness compared to others.
AB - This paper focuses on a scheduling problem of the evaporation and encapsulation (EVEN) line in organic light-emitting diode (OLED) display manufacturing towards minimizing total setup time and tardiness of allocated jobs. This scheduling problem is an unrelated dedicated parallel machine scheduling (UDPMS) problem with practical complex constraints including machine availability, family setup, preventive maintenance (PM), and job splitting. There are three major points to this problem. First, the processing of a job on a machine should be completed before its due date. Second, setups should be reduced to minimize labor costs. Finally, a job is able to be split into one or more sub-jobs for processing on machines independently. To obtain a schedule to minimize total setup time and tardiness of allocated jobs, we suggest two novel machine schedulers such as deep learning-based and self-growth learning-based schedulers, called DLS and SGLS, respectively. Although the structure of the proposed schedulers is identical, especially, SGLS incrementally learns to explore more effective allocation patterns by preserving the obtained knowledge from the trained DLS based on self-growth learning. The comprehensive experiments show that SGLS produces satisfactory schedules in terms of minimizing total setup time and tardiness. In particular, when the number of jobs and the ratio of job sizes are larger, SGLS achieves a schedule with both less setup time and tardiness compared to others.
KW - Deep learning
KW - Manufacturing
KW - Scheduling
KW - Self-growth learning
KW - Setup and tardiness
UR - http://www.scopus.com/inward/record.url?scp=85165528603&partnerID=8YFLogxK
U2 - 10.1016/j.asoc.2023.110600
DO - 10.1016/j.asoc.2023.110600
M3 - Article
AN - SCOPUS:85165528603
SN - 1568-4946
VL - 145
JO - Applied Soft Computing
JF - Applied Soft Computing
M1 - 110600
ER -