兩階段平行機台考慮工件可分割特性下求解最小完工時間;Two Stage Hybrid Flow Shop Scheduling with Job Splitting Property for Minimizing the Maximum Completion Time

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

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

Title:	兩階段平行機台考慮工件可分割特性下求解最小完工時間;Two Stage Hybrid Flow Shop Scheduling with Job Splitting Property for Minimizing the Maximum Completion Time
Authors:	黃少緯;Huang,Shao-wei
Contributors:	工業管理研究所
Keywords:	排程;分支界限法;多階段平行機台;工件可分割特性;Scheduling;Branch-and-bound algorithm;Hybrid flow shop;Job-splitting property
Date:	2014-07-28
Issue Date:	2014-10-15 14:34:21 (UTC+8)
Publisher:	國立中央大學
Abstract:	本論文我們研究一多階段平行機台環境下，有多個工件需要被進行加工處理，且每個工件具有可分割特性的排程問題，我們的目標是決定一最佳排程使得所有工件完工時間最小化。在過去大部分的排程問題都假設每個工件最多只能在一台機台上進行處理，然而在實務上經常會遇到一些情況是多個不同種類的產品，又有各自不同的數量需要在一條生產線上進行加工，在這種狀況下為了使完工時間能夠縮短，我們不會受限於原先的排程假設，我們將允許將相同工件分為多個的批量在不同的機台上同時進行加工，如此來避免機台有閒置的狀況發生。本研究中我們假設機台環境為兩階段平行機台的排程問題，第一階段有兩台相同平行機台，而第二階段只有單一機台，另外我們假設所有工件之間的整備時間彼此獨立。我們使用分支界限法來尋找此排程問題的最佳解，在演算法中我們提出了下限值和上限值的求算方法以及一些可以刪除不必要的節點法則來提升我們演算法的求解效率。最後我們將此演算法透過JAVA來實現並透過實驗數據來進行分析。 ;In this research, we consider the problem of scheduling n jobs on hybrid flow shop with job splitting property, and our objective is to minimize the maximum completion time. In the past, the majority of scheduling studies assumed that each job can be processed on at most one machine at a time. In the real word, there are many cases that have different types of products and each type of products have numbers of units need to go through a production line. In order to make these products finished as soon as possible, it is normal to schedule each unit of the same product on different machines at the same time. In this research, we assume that there are two identical parallel machines in the first stage and a single machine in second stage, and the setup time of each job are independent. We use a branch and bound algorithm to find the optimal solution for this problem. In this algorithm, we propose the lower bound and upper bound for this scheduling problem and we use some dominance rules to eliminate unnecessary nodes to improve the efficiency of our algorithm. Finally, we implement this algorithm by JAVA, and we conduct the computational analysis.
Appears in Collections:	[Graduate Institute of Industrial Management] Electronic Thesis & Dissertation

Files in This Item:

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

社群 sharing

Loading...