A Flexible Scheduling Model for the Unrelated Parallel Machines Production System

• Main Authors: CHIU-MEI HUANG, 黃秋媚
• Other Authors: Jai-Chin Jiang
• Format: Others
• Language: zh-TW
• Published: 2007
• Online Access: http://ndltd.ncl.edu.tw/handle/36587575729997007549

碩士 === 中原大學 === 工業工程研究所 === 95 === This research considers the scheduling problem about unrelated parallel machines with machine eligibility and sequence-dependent setup times. In practice, due to there are different importance ratings, sequence-dependent setup times and machine eligibility among orders, orders are not well allocated. Consequently, orders are delayed and capacity is not well utilized. Through this, the purpose of scheduling is to meet delivery dates and to reduce the capacity wastes. In this research, we expect to propose a scheduling operation model that can generate an optimal schedule to achieve the objectives of minimizing total weighted lateness and waste cost, and then make the production system can be more flexible in the arrangement and scheduling of machine, product, process, operation etc. This problem is a combinatorial optimization problem, which is proved as a NP- complete problem. However, the previous researches are falling short in the problems about unrelated parallel machines with machine eligibility and sequence-dependent setup times. In view of this, this study, based on the concepts and constraints of production scheduling, uses mathematical programming method to develop a flexible scheduling model mainly applied in a one-stage parallel-processor scheduling problem. Also, we have implemented it with an optimization software, ILOG OPL, to confirm the applicability of this model.