Order Scheduling with Total Order Completion Time on Non-Identical Parallel Machines
碩士 === 國立交通大學 === 工業工程與管理系所 === 102 === We study the order scheduling problem under the non-identical parallel machines environment in the fully flexible case. Our goal is to minimize total order completion time and the decision is to assign all jobs to all machines. We first show two lemmas for o...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2014
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/27639066444614093523 |
| id |
ndltd-TW-102NCTU5031091 |
|---|---|
| record_format |
oai_dc |
| spelling |
ndltd-TW-102NCTU50310912016-02-21T04:32:47Z http://ndltd.ncl.edu.tw/handle/27639066444614093523 Order Scheduling with Total Order Completion Time on Non-Identical Parallel Machines 最小化訂單總完工時間之平行機台排程問題 Fan, Jhen-Huang 范振晃 碩士 國立交通大學 工業工程與管理系所 102 We study the order scheduling problem under the non-identical parallel machines environment in the fully flexible case. Our goal is to minimize total order completion time and the decision is to assign all jobs to all machines. We first show two lemmas for optimal solution and separate our problem into two stages based on these lemmas. Then, we develop a series of two-stage heuristics to solve our problem. Finally, we implement numerical studies to verify the performance of our heuristics, and find out several factors that influence the performance of heuristics. Hsu, Hsi-Mei Hung, Hui-Chih 許錫美 洪暉智 2014 學位論文 ; thesis 30 en_US |
| collection |
NDLTD |
| language |
en_US |
| format |
Others
|
| sources |
NDLTD |
| description |
碩士 === 國立交通大學 === 工業工程與管理系所 === 102 === We study the order scheduling problem under the non-identical parallel machines environment in the fully flexible case. Our goal is to minimize total order completion time and the decision is to assign all jobs to all machines. We first show two lemmas for optimal solution and separate our problem into two stages based on these lemmas. Then, we develop a series of two-stage heuristics to solve our problem. Finally, we implement numerical studies to verify the performance of our heuristics, and find out several factors that influence the performance of heuristics.
|
| author2 |
Hsu, Hsi-Mei |
| author_facet |
Hsu, Hsi-Mei Fan, Jhen-Huang 范振晃 |
| author |
Fan, Jhen-Huang 范振晃 |
| spellingShingle |
Fan, Jhen-Huang 范振晃 Order Scheduling with Total Order Completion Time on Non-Identical Parallel Machines |
| author_sort |
Fan, Jhen-Huang |
| title |
Order Scheduling with Total Order Completion Time on Non-Identical Parallel Machines |
| title_short |
Order Scheduling with Total Order Completion Time on Non-Identical Parallel Machines |
| title_full |
Order Scheduling with Total Order Completion Time on Non-Identical Parallel Machines |
| title_fullStr |
Order Scheduling with Total Order Completion Time on Non-Identical Parallel Machines |
| title_full_unstemmed |
Order Scheduling with Total Order Completion Time on Non-Identical Parallel Machines |
| title_sort |
order scheduling with total order completion time on non-identical parallel machines |
| publishDate |
2014 |
| url |
http://ndltd.ncl.edu.tw/handle/27639066444614093523 |
| work_keys_str_mv |
AT fanjhenhuang orderschedulingwithtotalordercompletiontimeonnonidenticalparallelmachines AT fànzhènhuǎng orderschedulingwithtotalordercompletiontimeonnonidenticalparallelmachines AT fanjhenhuang zuìxiǎohuàdìngdānzǒngwángōngshíjiānzhīpíngxíngjītáipáichéngwèntí AT fànzhènhuǎng zuìxiǎohuàdìngdānzǒngwángōngshíjiānzhīpíngxíngjītáipáichéngwèntí |
| _version_ |
1718194171822473216 |