A Multi-stage Flow Shop Scheduling Problem with Resource Constraints and Limited Buffer

• Main Authors: Ming-Hua Tsai, 蔡明樺
• Other Authors: Chinyao Low
• Format: Others
• Language: zh-TW
• Published: 2012
• Online Access: http://ndltd.ncl.edu.tw/handle/57638270358274775501

碩士 === 國立雲林科技大學 === 全球運籌管理研究所碩士班 === 100 === Recently, the improvement of technology is quite fast, so there are always old and new machines in a manufacturing factory. Hence this research added resource constraint and limited buffer to the problem assumption of unrelated parallel machines flowshop, and made the assumption can be like the reality manufacturing situation. The solving result is makespan in research processes. First, this research constructed an integer programming model which is conformed to the situation and constraints of problem, and using mathematics optimum software to solve the small instances for verifying the model validity. In large instances, this research adopted Genetic Algorithm and Simulated Annealing to solve problems, and took these two algorithms to solve many kinds of problems. Finally, the average solving quality of Genetic Algorithm is better than Simulated Annealing in any scale instances.