Solving multiple-resource job shop scheduling by branch-and-bound technique

• Main Author: 張偉立
• Other Authors: 洪一峰
• Format: Others
• Language: zh-TW
• Published: 2004
• Online Access: http://ndltd.ncl.edu.tw/handle/m6s6g5

碩士 === 國立清華大學 === 工業工程與工程管理學系 === 92 === Job shop scheduling plays an important role in production scheduling. Many manufacturing scheduling problems can be modeled as a job shop scheduling problem. In recently years, there are many research works related to job shop scheduling, but most of theses works consider only single-resource on an operation. In high tech industries, such as semiconductor manufacturing, only machines are considered as limited resource. But, in many cases, an operation requires more than one resource. We call this kind of problem as multiple-resource scheduling. This research intends to solve multiple-resource job shop scheduling problem with the objective of minimizing makespan. Giffler and Thompson【1960】 introduced the disjunctive graph technique to represent job shop scheduling and used branch-and-bound technique to solve single-resource job shop scheduling problem. In this study, we modify disjunctive graph to represent multiple-resource job shop scheduling and develop a branch-and-bound technique to solve this problem. Experimental designs and statistical methods are used to evaluate and analyze the performance of the method. The results show that the number of resources, the number of jobs, the number of operations and the utilizations of resources affect the solution time used by branch-and bound method.