本研究中我們假設機台環境為兩階段平行機台的排程問題，第一階段有兩台相同平行機台，而第二階段只有單一機台，另外我們假設所有工件之間的整備時間彼此獨立。我們使用分支界限法來尋找此排程問題的最佳解，在演算法中我們提出了下限值和上限值的求算方法以及一些可以刪除不必要的節點法則來提升我們演算法的求解效率。最後我們將此演算法透過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.