Minimizing makespan on parallel machines with chamber and machine eligibility

碩士 === 中原大學 === 工業與系統工程研究所 === 106 === This study investigates scheduling problem related to machine eligibility and chamber constraints on a parallel machine, and discusses the scheduling of etching process technology in the semiconductor industry. The number of machines and that of jobs under inve...

Full description

Bibliographic Details
Main Authors: Shuo-Chien Kao, 高碩謙
Other Authors: ling-huey Su
Format: Others
Language:zh-TW
Published: 2018
Online Access:http://ndltd.ncl.edu.tw/handle/n4gcuy
id ndltd-TW-106CYCU5030022
record_format oai_dc
spelling ndltd-TW-106CYCU50300222019-10-31T05:22:07Z http://ndltd.ncl.edu.tw/handle/n4gcuy Minimizing makespan on parallel machines with chamber and machine eligibility 在平行機台下考慮反應室與機台限制求最小化最大完工時間之排程問題 Shuo-Chien Kao 高碩謙 碩士 中原大學 工業與系統工程研究所 106 This study investigates scheduling problem related to machine eligibility and chamber constraints on a parallel machine, and discusses the scheduling of etching process technology in the semiconductor industry. The number of machines and that of jobs under investigation are m and n respectively. Each job can only be processed on a specific machine and only on the chamber of the specific machine. The processing time of the job is known. When the job starts to work, it is not allowed to be intercepted. Each job is allocated to one machine. Each machine contains 3-4 chambers. When jobs are placed in the chamber of the machine, their processing time will be evenly distributed to each chamber of the machine .The job completion time of the chamber on each machine will be calculated. The goal is to minimize the makespan. Because this problem is the NP-hard problem, for the small-scale problem, this study proposes an integer programming model to find the best solution. Compared with the approximate solution obtained by the heuristic algorithm, the results show that compared with the optimal solution, the average deviation is 3.64%, which is shorter than the solution time of the mathematical programming model. For large-scale problems, the heuristic algorithm has a solution better than the Largest Processing Time(LPT). The average improvement rate is 4.61%. ling-huey Su 蘇玲慧 2018 學位論文 ; thesis 52 zh-TW
collection NDLTD
language zh-TW
format Others
sources NDLTD
description 碩士 === 中原大學 === 工業與系統工程研究所 === 106 === This study investigates scheduling problem related to machine eligibility and chamber constraints on a parallel machine, and discusses the scheduling of etching process technology in the semiconductor industry. The number of machines and that of jobs under investigation are m and n respectively. Each job can only be processed on a specific machine and only on the chamber of the specific machine. The processing time of the job is known. When the job starts to work, it is not allowed to be intercepted. Each job is allocated to one machine. Each machine contains 3-4 chambers. When jobs are placed in the chamber of the machine, their processing time will be evenly distributed to each chamber of the machine .The job completion time of the chamber on each machine will be calculated. The goal is to minimize the makespan. Because this problem is the NP-hard problem, for the small-scale problem, this study proposes an integer programming model to find the best solution. Compared with the approximate solution obtained by the heuristic algorithm, the results show that compared with the optimal solution, the average deviation is 3.64%, which is shorter than the solution time of the mathematical programming model. For large-scale problems, the heuristic algorithm has a solution better than the Largest Processing Time(LPT). The average improvement rate is 4.61%.
author2 ling-huey Su
author_facet ling-huey Su
Shuo-Chien Kao
高碩謙
author Shuo-Chien Kao
高碩謙
spellingShingle Shuo-Chien Kao
高碩謙
Minimizing makespan on parallel machines with chamber and machine eligibility
author_sort Shuo-Chien Kao
title Minimizing makespan on parallel machines with chamber and machine eligibility
title_short Minimizing makespan on parallel machines with chamber and machine eligibility
title_full Minimizing makespan on parallel machines with chamber and machine eligibility
title_fullStr Minimizing makespan on parallel machines with chamber and machine eligibility
title_full_unstemmed Minimizing makespan on parallel machines with chamber and machine eligibility
title_sort minimizing makespan on parallel machines with chamber and machine eligibility
publishDate 2018
url http://ndltd.ncl.edu.tw/handle/n4gcuy
work_keys_str_mv AT shuochienkao minimizingmakespanonparallelmachineswithchamberandmachineeligibility
AT gāoshuòqiān minimizingmakespanonparallelmachineswithchamberandmachineeligibility
AT shuochienkao zàipíngxíngjītáixiàkǎolǜfǎnyīngshìyǔjītáixiànzhìqiúzuìxiǎohuàzuìdàwángōngshíjiānzhīpáichéngwèntí
AT gāoshuòqiān zàipíngxíngjītáixiàkǎolǜfǎnyīngshìyǔjītáixiànzhìqiúzuìxiǎohuàzuìdàwángōngshíjiānzhīpáichéngwèntí
_version_ 1719283545637126144