具機器可用時間與機器合適度限制和相依整備作業之平行機台排程問題; An Identical Parallel-Machine Scheduling Problem with the Consideration of Machine Availability, Eligibility and Dependent Setup Time

NCUIR > School of Management at National Central University > Graduate Institute of Industrial Management > Electronic Thesis & Dissertation > Item 987654321/48703

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/48703

Title:	具機器可用時間與機器合適度限制和相依整備作業之平行機台排程問題;An Identical Parallel-Machine Scheduling Problem with the Consideration of Machine Availability, Eligibility and Dependent Setup Time
Authors:	江曜君;Yao-jun Jiang
Contributors:	工業管理研究所
Keywords:	排程、分枝界限法;平行機台;可用時間限制;合適度限制;相依整備作業;machine eligibility;dependent setup time;total completion time;parallel machine;branch and bound algorithm;machine availability;non-preemptive jobs
Date:	2011-07-19
Issue Date:	2012-01-05 15:04:18 (UTC+8)
Abstract:	在此研究中，我們考慮當極小化總作業之完工時間時，在具機器可用時間與機器合適度且整備作業相依化的限制下，n個不可分割的工作和m台等效平行機台的排程問題。每台機器只有某些時間區段可以被安排處理工作，每個工作也只能被安排在某些特定的機器上，而每當我們欲服務工作時其必須先執行一個整備作業好讓機台的生產環境符合此工作的需求，而此整備作業的執行時間則是由此機台的前續作業與接下來要服務的作業種類來決定的，因此我們才會稱此整備作業為相依的。在此我們提出一個分枝界限演算法去尋找這個問題的最佳解。首先，我們修改Liao & Sheen (2007)切割時間區間的方式，將時間區間以各機台獨立的方式去做切割，再者我們將欲規劃的各工作視為不能分割的情況下去提出下界值的計算方式，最後我們提出分枝的方式與減少分枝不必要分枝的方法。而我們所提出的方法透過我們設計的實驗可以發現兩件事情。第一我們可以發現當問題環境於機器總數相同的情況下，當我欲處理較多的工作時，倘若我們使用相依方式處理時間區間時將使得其獲得最佳解的時間與使用獨立切割時間區間的方法來的長的許多。第二，我們也可以發現當預處理的問題越大時，其下界的刪除無用的分枝效率會越來越高。 In this thesis, we consider the problem of scheduling n non-preemptive jobs on m identical machines with machine availability, eligibility and dependent setup time. The problem comes from industrial applications. Each machine is not continuously available at all time and each job is only allowed to be processed on specific machines. Dependent setup is that the setup time is determined not only by that job but also by the previous job. Then we hope we will develop an efficient algorithm to solve this problem. First, we focus on our constraint, machine availability to modify the method used in Liao & Sheen (2007) to deal with it. We divide all time epochs on each machine independently and look forward to spend less time getting our solution. Then we propose our lower bound. It doesn’t apply the usual way seem all jobs are preemptive to calculate the value of bound. I still think our jobs are not preemptive to get a value closing the actual situation. Besides, we propose branching schema, propositions and dominance rules to construct our branch and bound algorithm. Finally, through our experiment we could realize the performance of our lower bound and the decision of dealing with machine availability. We find that when the problem size becomes bigger and bigger, the lower bound we proposed can help us cut more and more meaningless bounds. Similarly, we also can find that on the same machine size when III we want to solve the problem with more and more jobs, we have to spend much time calculating it. On the other hand, we finally propose some comments and limitations of the studied problem in the end of the thesis.
Appears in Collections:	[Graduate Institute of Industrial Management] Electronic Thesis & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	648	View/Open

社群 sharing

Loading...