A hybrid Algorithm for Minimizing the Total Tardiness for Sequence-Dependent Family Setup Time Scheduling Problem on Unrelated Parallel Machines
碩士 === 逢甲大學 === 工業工程與系統管理學研究所 === 96 === Minimizing the total tardiness for sequence-dependent family setup time scheduling problem on unrelated parallel machines is an NP-hard problem.When dealing with big problem in reality, it is almost impossible to find the optimize solution in reasonable perio...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2008
|
Online Access: | http://ndltd.ncl.edu.tw/handle/21964256911180561415 |
id |
ndltd-TW-096FCU05031006 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-096FCU050310062016-05-18T04:13:38Z http://ndltd.ncl.edu.tw/handle/21964256911180561415 A hybrid Algorithm for Minimizing the Total Tardiness for Sequence-Dependent Family Setup Time Scheduling Problem on Unrelated Parallel Machines 運用混合啟發式解法於總延遲時間最小化之整備時間為族群順序相依的非相關平行機器排程問題 Jyh-Miin Yang 楊智敏 碩士 逢甲大學 工業工程與系統管理學研究所 96 Minimizing the total tardiness for sequence-dependent family setup time scheduling problem on unrelated parallel machines is an NP-hard problem.When dealing with big problem in reality, it is almost impossible to find the optimize solution in reasonable period of time. This study will first use apparent tardiness cost with setup (ATCS) procedure to generate a fast solution, then use simulated annealing method and combined heuristic method to improve the fast solution in order to find the optimal solution or approximate optimal solution in reasonable period of time for business use. In order to evaluate the efficiency and quality of the method developed by this study, the method will be tested on a set of random generated probleosm and compare the results to a Random Descent Heuristic(RDH) method. Jeng-Fung Chen 陳正芳 2008 學位論文 ; thesis 51 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 逢甲大學 === 工業工程與系統管理學研究所 === 96 === Minimizing the total tardiness for sequence-dependent family setup time scheduling problem on unrelated parallel machines is an NP-hard problem.When dealing with big problem in reality, it is almost impossible to find the optimize solution in reasonable period of time. This study will first use apparent tardiness cost with setup (ATCS) procedure to generate a fast solution, then use simulated annealing method and combined heuristic method to improve the fast solution in order to find the optimal solution or approximate optimal solution in reasonable period of time for business use. In order to evaluate the efficiency and quality of the method developed by this study, the method will be tested on a set of random generated probleosm and compare the results to a Random Descent Heuristic(RDH) method.
|
author2 |
Jeng-Fung Chen |
author_facet |
Jeng-Fung Chen Jyh-Miin Yang 楊智敏 |
author |
Jyh-Miin Yang 楊智敏 |
spellingShingle |
Jyh-Miin Yang 楊智敏 A hybrid Algorithm for Minimizing the Total Tardiness for Sequence-Dependent Family Setup Time Scheduling Problem on Unrelated Parallel Machines |
author_sort |
Jyh-Miin Yang |
title |
A hybrid Algorithm for Minimizing the Total Tardiness for Sequence-Dependent Family Setup Time Scheduling Problem on Unrelated Parallel Machines |
title_short |
A hybrid Algorithm for Minimizing the Total Tardiness for Sequence-Dependent Family Setup Time Scheduling Problem on Unrelated Parallel Machines |
title_full |
A hybrid Algorithm for Minimizing the Total Tardiness for Sequence-Dependent Family Setup Time Scheduling Problem on Unrelated Parallel Machines |
title_fullStr |
A hybrid Algorithm for Minimizing the Total Tardiness for Sequence-Dependent Family Setup Time Scheduling Problem on Unrelated Parallel Machines |
title_full_unstemmed |
A hybrid Algorithm for Minimizing the Total Tardiness for Sequence-Dependent Family Setup Time Scheduling Problem on Unrelated Parallel Machines |
title_sort |
hybrid algorithm for minimizing the total tardiness for sequence-dependent family setup time scheduling problem on unrelated parallel machines |
publishDate |
2008 |
url |
http://ndltd.ncl.edu.tw/handle/21964256911180561415 |
work_keys_str_mv |
AT jyhmiinyang ahybridalgorithmforminimizingthetotaltardinessforsequencedependentfamilysetuptimeschedulingproblemonunrelatedparallelmachines AT yángzhìmǐn ahybridalgorithmforminimizingthetotaltardinessforsequencedependentfamilysetuptimeschedulingproblemonunrelatedparallelmachines AT jyhmiinyang yùnyònghùnhéqǐfāshìjiěfǎyúzǒngyánchíshíjiānzuìxiǎohuàzhīzhěngbèishíjiānwèizúqúnshùnxùxiāngyīdefēixiāngguānpíngxíngjīqìpáichéngwèntí AT yángzhìmǐn yùnyònghùnhéqǐfāshìjiěfǎyúzǒngyánchíshíjiānzuìxiǎohuàzhīzhěngbèishíjiānwèizúqúnshùnxùxiāngyīdefēixiāngguānpíngxíngjīqìpáichéngwèntí AT jyhmiinyang hybridalgorithmforminimizingthetotaltardinessforsequencedependentfamilysetuptimeschedulingproblemonunrelatedparallelmachines AT yángzhìmǐn hybridalgorithmforminimizingthetotaltardinessforsequencedependentfamilysetuptimeschedulingproblemonunrelatedparallelmachines |
_version_ |
1718271775238782976 |