Minimizing the Makespan of Two-machine Flow Shop with Deteriorating Jobs and Truncated Learning Effect Setup time
碩士 === 國立成功大學 === 工業與資訊管理學系 === 102 === This study investigates the two-machine flow shop scheduling problem with deteriorating jobs and truncated learning effect setup time. The objective is to minimize the makespan. A dominance property, five upper bounds and two lower bounds are employed to const...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2014
|
Online Access: | http://ndltd.ncl.edu.tw/handle/35550740297867710524 |
id |
ndltd-TW-102NCKU5041014 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-102NCKU50410142016-03-07T04:10:55Z http://ndltd.ncl.edu.tw/handle/35550740297867710524 Minimizing the Makespan of Two-machine Flow Shop with Deteriorating Jobs and Truncated Learning Effect Setup time 退化性工作中整備工作具學習效應的兩機台流程生產排程問題-最大完工時間最小化 Bo-LinSu 蘇柏霖 碩士 國立成功大學 工業與資訊管理學系 102 This study investigates the two-machine flow shop scheduling problem with deteriorating jobs and truncated learning effect setup time. The objective is to minimize the makespan. A dominance property, five upper bounds and two lower bounds are employed to construct the branch and bound algorithm. Furthermore, a genetic algorithm is developed to find a near optimal solution efficiently. Finally, computation experiments are conducted to evaluate the performance of these two algorithms. Shiow-Yun Chang 張秀雲 2014 學位論文 ; thesis 65 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立成功大學 === 工業與資訊管理學系 === 102 === This study investigates the two-machine flow shop scheduling problem with deteriorating jobs and truncated learning effect setup time. The objective is to minimize the makespan. A dominance property, five upper bounds and two lower bounds are employed to construct the branch and bound algorithm. Furthermore, a genetic algorithm is developed to find a near optimal solution efficiently. Finally, computation experiments are conducted to evaluate the performance of these two algorithms.
|
author2 |
Shiow-Yun Chang |
author_facet |
Shiow-Yun Chang Bo-LinSu 蘇柏霖 |
author |
Bo-LinSu 蘇柏霖 |
spellingShingle |
Bo-LinSu 蘇柏霖 Minimizing the Makespan of Two-machine Flow Shop with Deteriorating Jobs and Truncated Learning Effect Setup time |
author_sort |
Bo-LinSu |
title |
Minimizing the Makespan of Two-machine Flow Shop with Deteriorating Jobs and Truncated Learning Effect Setup time |
title_short |
Minimizing the Makespan of Two-machine Flow Shop with Deteriorating Jobs and Truncated Learning Effect Setup time |
title_full |
Minimizing the Makespan of Two-machine Flow Shop with Deteriorating Jobs and Truncated Learning Effect Setup time |
title_fullStr |
Minimizing the Makespan of Two-machine Flow Shop with Deteriorating Jobs and Truncated Learning Effect Setup time |
title_full_unstemmed |
Minimizing the Makespan of Two-machine Flow Shop with Deteriorating Jobs and Truncated Learning Effect Setup time |
title_sort |
minimizing the makespan of two-machine flow shop with deteriorating jobs and truncated learning effect setup time |
publishDate |
2014 |
url |
http://ndltd.ncl.edu.tw/handle/35550740297867710524 |
work_keys_str_mv |
AT bolinsu minimizingthemakespanoftwomachineflowshopwithdeterioratingjobsandtruncatedlearningeffectsetuptime AT sūbǎilín minimizingthemakespanoftwomachineflowshopwithdeterioratingjobsandtruncatedlearningeffectsetuptime AT bolinsu tuìhuàxìnggōngzuòzhōngzhěngbèigōngzuòjùxuéxíxiàoyīngdeliǎngjītáiliúchéngshēngchǎnpáichéngwèntízuìdàwángōngshíjiānzuìxiǎohuà AT sūbǎilín tuìhuàxìnggōngzuòzhōngzhěngbèigōngzuòjùxuéxíxiàoyīngdeliǎngjītáiliúchéngshēngchǎnpáichéngwèntízuìdàwángōngshíjiānzuìxiǎohuà |
_version_ |
1718198947810377728 |