DC 欄位 | 值 | 語言 |
dc.contributor.author | 賴聰乾 | zh_TW |
dc.creator | 賴聰乾 | zh_TW |
dc.date | 2003 | zh_TW |
dc.date.accessioned | 2006-07-25T05:11:14Z | - |
dc.date.accessioned | 2018-06-29T08:52:46Z | - |
dc.date.available | 2006-07-25T05:11:14Z | - |
dc.date.available | 2018-06-29T08:52:46Z | - |
dc.date.issued | 2003 | - |
dc.identifier | 912416H002006 | zh_TW |
dc.identifier.uri | http://ntur.lib.ntu.edu.tw//handle/246246/3077 | - |
dc.description.abstract | 本報告呈現關於雙機串聯排序問題方面之有趣(值得發表於國際刊物)研
究結果。該問題中,雙機之任一部機器皆有可能存在若干個非可用時段,作業目
標在使作業全程最小。機器之非可用時段係裝配排程常見之限制條件。只要存在
有一非可用時段(不論是發生於第一或第二部機器),該問題便是binary
NP-hard 。對給定之非可用時段個數w,就Johnson 排序之最適狀態,推導充分
與必要條件。亦對該問題從事穩定度分析,並從事計算實驗,實驗範圍:工作數
介於5 至10000 間且非可用時段個數介於 1 至1000 。 | zh_TW |
dc.description.abstract | This report presents an interesting research result, which seems publishable in a
well-recognized international journal, on a sequencing problem of minimizing the
makespan in the two-machine-in-series n-job with w non-availability intervals on
each of the two machines. The non-availability of a machine often occurs in the
scenarios of assembly line sequencing. This problem is binary NP-hard even if there
is only one non-availability interval either on the first or the second machine.
Sufficient conditions are derived for optimality of Johnson’s permutation in the case
of the given w >= 1 non-availability intervals. A stability analysis is conducted and
demonstrated on a huge number of randomly generated problem instances with n
between 5 and 10000, and w between 1 and 1000. | en |
dc.format | application/pdf | zh_TW |
dc.format.extent | 104287 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.language | zh-TW | zh_TW |
dc.language.iso | zh_TW | - |
dc.publisher | 臺北市:國立臺灣大學工商管理學系 | zh_TW |
dc.rights | 國立臺灣大學工商管理學系 | zh_TW |
dc.subject | 雙機 | zh_TW |
dc.subject | 排序 | zh_TW |
dc.subject | 非可用時段 | zh_TW |
dc.subject | 穩定度分析 | zh_TW |
dc.subject | 作業全程 | zh_TW |
dc.subject | NP-難度 | zh_TW |
dc.subject | two-machine | en |
dc.subject | sequencing | en |
dc.subject | non-availability intervals | en |
dc.subject | stability analysis | en |
dc.subject | makespan | en |
dc.subject | NP-hard | en |
dc.title | 作業時間不固定下之裝配線平衡與排序:新數學模型與方法 | zh_TW |
dc.title.alternative | New Mathematical Models and Methods for Assembly Line Balancing
and Sequencing with Random and Bounded Operations Times | en |
dc.type | report | en |
dc.identifier.uri.fulltext | http://ntur.lib.ntu.edu.tw/bitstream/246246/3077/1/912416H002006.pdf | - |
dc.coverage | 計畫年度:91;起迄日期:2002-08-01/2003-07-31 | zh_TW |
item.languageiso639-1 | zh_TW | - |
item.fulltext | with fulltext | - |
item.grantfulltext | open | - |
item.openairetype | report | - |
item.openairecristype | http://purl.org/coar/resource_type/c_93fc | - |
item.cerifentitytype | Publications | - |
顯示於: | 工商管理學系
|