A New-Based Algorithm for Scheduling Problem in Tool Machine Industry with Constraints from Critical Part Supply

• Main Authors: chien-po chen, 陳建柏
• Other Authors: 胡坤德
• Format: Others
• Language: zh-TW
• Published: 2004
• Online Access: http://ndltd.ncl.edu.tw/handle/01630530618427984518

碩士 === 東海大學 === 工業工程與經營資訊學系 === 92 === In this study, we propose an algorithm for the scheduling problem in machine tool industry with considering the constraints from the supply of critical parts based on Drum-Buffer-Rope (DBR) philosophy. In the literature, most of the DBR-based algorithms solve the scheduling problems in industries other than machine tool industry. The production systems in machine tool industry usually have the following characteristics; namely, long flow time and manufacturing processes with reentrants, …, etc. These characteristics makethe decision-making scenario is very different from others, and one is not able tosatisfactorily solve the scheduling problem by directly applying those DBR-based algorithms in the literature. Also, most of the existing DBR-based algorithms assume that the supply of materials will not be the constraints of the production system. In order to make it match with the real-world cases, we take into accounts the constraints from the supply of critical parts in the proposed DBR-based algorithm. By integrating our scheduling algorithms with friendly interfaces, we provide a proto-type information system as an effective decision support system for the managers of the production systems in machine industry.