| Summary: | 碩士 === 東海大學 === 資訊管理學系 === 107 === The economic lot scheduling problem (ELSP) is a valuable mathematical model that can support decision makers to make appropriate decisions. Multiple facility and production-rate changing are the extension topics of the relative research for the ELSP. The traditional assumption for solving the ELSP was that the product must be produced at the maximum production rate. However, when a facility has idle time, a product should be produced at a lower production rate in order to reduce the average total cost. In the past, for solving the ELSP, there was no study to discuss the issue which change the production rate of a product. This study integrates the grouping genetic algorithm and fixed-rate method to solve ELSP with multiple facility. The experimental data show that the grouping genetic algorithm can get better solutions that as sign which product to which facility. And the fixed rate method can fully utilize the idle time for a facility to reduce the average total cost. Compared with other previous studies, the experiment data shows that our approach can get better solutions. .
|
|---|
