An exploration of the multi-machine re-entrant flow shop scheduling problem with learning consideration to minimize the makespan

碩士 === 逢甲大學 === 應用統計研究所 === 101

Bibliographic Details
Main Authors:	Shih-yuan Liu, 劉詩媛
Other Authors:	吳進家
Format:	Others
Language:	zh-TW
Published:	2013
Online Access:	http://ndltd.ncl.edu.tw/handle/36270339839593618057

id	ndltd-TW-101FCU05506067
record_format	oai_dc
spelling	ndltd-TW-101FCU055060672015-10-13T22:57:02Z http://ndltd.ncl.edu.tw/handle/36270339839593618057 An exploration of the multi-machine re-entrant flow shop scheduling problem with learning consideration to minimize the makespan 一個伴隨經驗學習效果且具迴流的流線型機台最大完工時間最小化之研究 Shih-yuan Liu 劉詩媛碩士逢甲大學應用統計研究所 101 吳進家林文欽 2013 學位論文 ; thesis 85 zh-TW
collection	NDLTD
language	zh-TW
format	Others
sources	NDLTD
description	碩士 === 逢甲大學 === 應用統計研究所 === 101
author2	吳進家
author_facet	吳進家 Shih-yuan Liu 劉詩媛
author	Shih-yuan Liu 劉詩媛
spellingShingle	Shih-yuan Liu 劉詩媛 An exploration of the multi-machine re-entrant flow shop scheduling problem with learning consideration to minimize the makespan
author_sort	Shih-yuan Liu
title	An exploration of the multi-machine re-entrant flow shop scheduling problem with learning consideration to minimize the makespan
title_short	An exploration of the multi-machine re-entrant flow shop scheduling problem with learning consideration to minimize the makespan
title_full	An exploration of the multi-machine re-entrant flow shop scheduling problem with learning consideration to minimize the makespan
title_fullStr	An exploration of the multi-machine re-entrant flow shop scheduling problem with learning consideration to minimize the makespan
title_full_unstemmed	An exploration of the multi-machine re-entrant flow shop scheduling problem with learning consideration to minimize the makespan
title_sort	exploration of the multi-machine re-entrant flow shop scheduling problem with learning consideration to minimize the makespan
publishDate	2013
url	http://ndltd.ncl.edu.tw/handle/36270339839593618057
work_keys_str_mv	AT shihyuanliu anexplorationofthemultimachinereentrantflowshopschedulingproblemwithlearningconsiderationtominimizethemakespan AT liúshīyuàn anexplorationofthemultimachinereentrantflowshopschedulingproblemwithlearningconsiderationtominimizethemakespan AT shihyuanliu yīgèbànsuíjīngyànxuéxíxiàoguǒqiějùhuíliúdeliúxiànxíngjītáizuìdàwángōngshíjiānzuìxiǎohuàzhīyánjiū AT liúshīyuàn yīgèbànsuíjīngyànxuéxíxiàoguǒqiějùhuíliúdeliúxiànxíngjītáizuìdàwángōngshíjiānzuìxiǎohuàzhīyánjiū AT shihyuanliu explorationofthemultimachinereentrantflowshopschedulingproblemwithlearningconsiderationtominimizethemakespan AT liúshīyuàn explorationofthemultimachinereentrantflowshopschedulingproblemwithlearningconsiderationtominimizethemakespan
_version_	1718082432474808320

An exploration of the multi-machine re-entrant flow shop scheduling problem with learning consideration to minimize the makespan

Similar Items