跳至主導覽 跳至搜尋 跳過主要內容

Solving the mask data preparation scheduling problem using meta-heuristics

  • Kuo Ching Ying
  • , Shih Wei Lin*
  • , Chien Yi Huang
  • , Memphis Liu
  • , Chia Tien Lin
  • *此作品的通信作者
  • National Taipei University of Technology
  • Chang Gung University
  • Chang Gung Memorial Hospital
  • Ming Chi University of Technology
  • Nanya Technology

研究成果: 期刊稿件文章同行評審

2 引文 斯高帕斯(Scopus)

摘要

Mask data preparation (MDP) is a part of the mask data process for fabricating semiconductors, and its importance has commonly been neglected. This paper proposes an integer linear programming model and two meta-heuristics, a genetic algorithm (GA) and simulated annealing (SA), for solving the MDP scheduling problem (MDPSP). The proposed meta-heuristics are empirically evaluated using 768 simulation instances of MDPSP based on the characteristics of a real technology company and compared with the most commonly used first-come, first-served method. The experimental results reveal that the proposed GA and SA algorithms can critically improve the manufacturing schedule for semiconductor factories.

原文英語
文章編號8642834
頁(從 - 到)24192-24203
頁數12
期刊IEEE Access
7
DOIs
出版狀態已出版 - 2019
對外發佈

文獻附註

Publisher Copyright:
© 2013 IEEE.

UN SDG

此研究成果有助於以下永續發展目標

  1. SDG9 工業、創新基礎建設
    SDG9 工業、創新基礎建設

指紋

深入研究「Solving the mask data preparation scheduling problem using meta-heuristics」主題。共同形成了獨特的指紋。

引用此