Considering Reduced Capacity for Unrelated Parallel-Machine Scheduling Problem

• Main Authors: Guan-yu Lin, 林冠宇
• Other Authors: Chin-Yao Low
• Format: Others
• Language: zh-TW
• Published: 2013
• Online Access: http://ndltd.ncl.edu.tw/handle/55529811306756847675

碩士 === 國立雲林科技大學 === 工業工程與管理研究所碩士班 === 101 === This study presents the capacity reduction for unrelated parallel machine scheduling problem, and solving by the heuristic simulated annealing algorithm. As the factory have K old and new parallel machines, due to the constraint of reducing capacity, the floor having to decrease Z machines. We must select the appropriate machine to out of service first, to assign the jobs to the existing machines then sorting, in order to minimize the total cost. But selecting the (K-Z) machines from the existing K machines to schedule, it will generate (K|(K-Z)) possible combinations. The selection of machine combination will make solving time significantly increased. It is difficult to obtain optimal solutions in finite time. So, the study uses a special local search approach, with Simulated Annealing (SA) algorithm to reduce the original solving time required of the mathematical programming method, at the same time to get acceptable solution. Through experimental design to compare with differences of the traditional simulated annealing and the proposed heuristic simulated annealing, confirmed on solving this problem. And the proposed method can indeed give consideration to both the quality and stability with finite time.