Scheduling Unrelated Parallel-Machine to Minimize Total Weighted Tardiness

• Main Authors: Yang-Kuei Lin, 林暘桂
• Other Authors: Ching-Fang Liaw
• Format: Others
• Language: zh-TW
• Published: 2001
• Online Access: http://ndltd.ncl.edu.tw/handle/46452156118203015871

碩士 === 朝陽科技大學 === 工業工程與管理系碩士班 === 89 === The unrelated parallel-machine scheduling problem can be stated as follows. There are n independent jobs and m different machines. Each job needs to be scheduled exactly on one machine, and every machine can process at most one job at a time. We assume that the machines are continuously available, no preemption or job splitting is allowed. An unrelated parallel-machine scheduling problem may occur in a variety of production environments or flexible manufacturing systems, such as textile industry, mechanic industry, and semiconductor manufacturing industry. It is well known that most of the unrelated parallel-machine scheduling problems are NP-hard. Currently, the unrelated parallel-machine scheduling research has been focusing on minimizing makespan or flow time. Recently, due date related performance criteria have become increasingly popular. In this study, we shall examine the total weighted tardiness unrelated parallel-machine scheduling problem, which is also NP-hard. The objective of this study is to develop an exact solution method, based on branch-and-bound algorithm, for solving small-scaled problems, and to develop an efficient heuristic solution method for solving large-scaled problems. Currently, no exact solution method has been developed in the literature. Finally, performance of the proposed branch-and-bound method and heuristic method will be evaluated through a large number of randomly generated problems.