Minimizing number of tardy jobs on unrelated parallel machines with dirt cleaning activities
碩士 === 中原大學 === 工業與系統工程研究所 === 105 === This thesis considers a unrelated parallel machines scheduling problem with several unavailability periods on each machine, where the machine has to be stopped in order to change the cleaning agent. The problem appears in the process in wafer manufacturing comp...
Main Authors: | Huang-Chia Cheng, 黃家成 |
---|---|
Other Authors: | Ling-Huey Su |
Format: | Others |
Language: | zh-TW |
Published: |
2017
|
Online Access: | http://ndltd.ncl.edu.tw/handle/58845608590556316115 |
Similar Items
-
Minimizing the number of tardy jobs on unrelated parallel machines with contaminant consideration
by: Ming-Chih Hsiao, et al.
Published: (2019) -
Scheduling jobs with dirt cleaning consideration to minimize the total tardiness
by: Lin, YU-HSUAN, et al.
Published: (2016) -
Scheduling Unrelated Parallel-Machine to Minimize Total Weighted Tardiness
by: Yang-Kuei Lin, et al.
Published: (2001) -
Scheduling on uniform parallel machines to minimize the number of tardy jobs
by: Kun-Sian Lin, et al.
Published: (2008) -
Minimizing number of tardy jobs on identical parallel machines with machine eligibility restriction
by: Ling-Jung Lin, et al.
Published: (2008)