https://scholars.lib.ntu.edu.tw/handle/123456789/99019
Title: | 作業時間不固定下之裝配線平衡與排序:新數學模型與方法 | Other Titles: | New Mathematical Models and Methods for Assembly Line Balancing and Sequencing with Random and Bounded Operations Times | Authors: | 賴聰乾 | Keywords: | 雙機;排序;非可用時段;穩定度分析;作業全程;NP-難度;two-machine;sequencing;non-availability intervals;stability analysis;makespan;NP-hard | Issue Date: | 2003 | Publisher: | 臺北市:國立臺灣大學工商管理學系 | Abstract: | 本報告呈現關於雙機串聯排序問題方面之有趣(值得發表於國際刊物)研 究結果。該問題中,雙機之任一部機器皆有可能存在若干個非可用時段,作業目 標在使作業全程最小。機器之非可用時段係裝配排程常見之限制條件。只要存在 有一非可用時段(不論是發生於第一或第二部機器),該問題便是binary NP-hard 。對給定之非可用時段個數w,就Johnson 排序之最適狀態,推導充分 與必要條件。亦對該問題從事穩定度分析,並從事計算實驗,實驗範圍:工作數 介於5 至10000 間且非可用時段個數介於 1 至1000 。 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. |
URI: | http://ntur.lib.ntu.edu.tw//handle/246246/3077 | Other Identifiers: | 912416H002006 | Rights: | 國立臺灣大學工商管理學系 |
Appears in Collections: | 工商管理學系 |
File | Description | Size | Format | |
---|---|---|---|---|
912416H002006.pdf | 101.84 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.