SIA OpenIR  > 数字工厂研究室
Alternative TitleResearch on Batch Scheduling in Semiconductor Assembly Manufacturing
Thesis Advisor刘昶
Keyword半导体封装测试 分布估计算法 概率模型 启发式规则 批调度
Call NumberF253/Z32/2016
Degree Discipline控制工程
Degree Name硕士
Degree Grantor中国科学院沈阳自动化研究所
Place of Conferral沈阳
Other AbstractIn this paper, aiming at minimizing the makespan and the maximum weighted idle time for batch scheduling of the processing equipment in the semiconductor packaging stage, we proposed a rule-based rP EDA algorithms and one combinatorial optimization algorithms (EDA-BATC), and we verify the effectiveness and feasibility of each new algorithm through the simulation tests . The main contents and results achieved are as follows: 1) In the packaging and testing stage of the semiconductor manufacturing process, we have analyzed its manufacturing process and the unique characteristics of the manufacturing process, and give the problem description against the batch scheduling of the processing equipment in the cured part of loading and plastic, we also carry out studies of related algorithm about aiming at minimizing the make span and the maximum weighted idle time for batch scheduling of the processing equipment. 2)In the semiconductor assembling and testing phase ,aiming at minimizing the make span and the maximum weighted idle time for batch scheduling of the processing equipment, we have proposed a new EDA algorithm based on rP rule, the main idea of this algorithm is minimizing the machine idle time by reducing the waiting time and processing the job with the longer processing time with the priority, meantime, combining the evolutionary thought in the EDA algorithm, and finally achieving the optimization in the make span. 3) we have designed a combinatorial optimization algorithm (EDA-BATC) to deal with the problem of minimizing the total weight loss of working time in the batch processing equipment scheduling. Firstly, through experiments designing, we proved the effection of the EDA algorithm in dealing with total weight loss of working time in the single batch scheduling problem. Then we split the batch scheduling problem into two sub-problems: batch operation and batch scheduling In the combinatorial optimization algorithm (EDA-BATC), we have considered the time complexity and quality of solutions. At last, through the comparison with other algorithms, we embodies the advantages of this algorithm.
Contribution Rank1
Document Type学位论文
Recommended Citation
GB/T 7714
张奎. 半导体封装阶段批加工设备调度研究[D]. 沈阳. 中国科学院沈阳自动化研究所,2016.
Files in This Item:
File Name/Size DocType Version Access License
半导体封装阶段批加工设备调度研究.pdf(1403KB)学位论文 开放获取CC BY-NC-SAApplication Full Text
Related Services
Recommend this item
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[张奎]'s Articles
Baidu academic
Similar articles in Baidu academic
[张奎]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[张奎]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.