A tabu search algorithm for the unrelated parallel machines scheduling problem of drilling operations in PCB factoty

• Main Authors: Lich-Chao Hsu, 徐烈昭
• Other Authors: Pei-Chann Chang
• Format: Others
• Language: zh-TW
• Published: 2001
• Online Access: http://ndltd.ncl.edu.tw/handle/59979730497758944625

碩士 === 元智大學 === 工業工程研究所 === 89 === Unrelated parallel machines are often seen in the shop floor. For accelerating production rate or to ease the workload of bottleneck machine, new similar machines are acquired. The production capabilities of the parallel machines are similar but production rates are not totally equivalent. Owing to the differences, how to sequence the parallel machines are important not only to effectively reduce the cycle times, numbers of changeovers but also to promote the utility and meet the due-dates. The purpose of dividing the part is to distribute the divided parts onto the parallel machines for meeting the due-date. Therefore few numbers of divided parts leads to tardiness and high penal cost. If the numbers of divided parts is appropriate, the part will be processed with the minimized total cost. In this research, we investigate the unrelated parallel machine scheduling problem of drilling operations in PCB factory. Tabu search is applied to minimize the tardiness and production costs of machines under the considerations of part-dividing, priorities, and setup times. It finally leads to satisfactory and stable results.