在n個工件的三機台中流程式排程問題中,設置成本被視為與加工時間是分開來的且與加工順序是獨立的,而目標為最小化最後完工時間。在實際發生之前,設置與加工時間二者是未知的變數。然而,設置與加工時間的上限及下限是可預先得知的。針對這一類的問題,針對所有可能的實際設置與加工時間,可能存在著不只一個獨特的最佳解。因此,有必要去儘可能地去獲得一組凌越的排程集合。本論文的目標即是減少凌越集合的大小,而其中一個減少凌越集合的大小的方法就是使用凌越關係。在本論文中,全域及區域的凌越關係被發展出來以解決這個問題。更進一步地,針對一個問題使用所發展的凌越關係來作減少凌越集合的大小的示範,並對一些亂數產生的問題,進行計算上的分析。
The problem of scheduling n jobs on a three-machine flowshop is addressed where setup times are considered as separate from processing times and sequence-independent. The objective is to minimize makespan. Both setup and processing times are unknown variables before the actual occurrence of these times. However, a lower bound and an upper bound are given (known) for each setup and processing time. For this problem, there may not exist a unique schedule that remains optimal for all possible realizations of setup and processing times. Hence, it is desirable to obtain a set of dominating set of schedules (which dominate all other schedules) if possible. The objective is to reduce the size of dominating set. One way of reducing the size of dominating set is to come up with dominance relations. In this paper, global and local dominance relations are developed for the problem. Moreover, the use of developed dominance relations to reduce the size of the set is illustrated by an example and computational analysis is conducted on randomly generated problems.
為了持續優化網站功能與使用者體驗,本網站將Cookies分析技術用於網站營運、分析和個人化服務之目的。
若您繼續瀏覽本網站,即表示您同意本網站使用Cookies。