The economic lot scheduling problem in limited-buffer flexible flow shops: Mathematical models and a discrete fruit fly algorithm |
| |
| Affiliation: | 1. School of Information and Control Engineering, China University of Mining and Technology, Xuzhou 221116, China;2. School of Information Science and Technology, Qingdao University of Science and Technology, Qingdao 266061, China;3. School of Computer Science, Liaocheng University, Liaocheng 252059, China;4. School of Mathematics and Statistics, Xian Jiaotong University, Xian 710049, China;1. Mechanical and Industrial Engineering Department, Qatar University, Doha, Qatar;2. Industrial Engineering Department, Yasar University, Izmir, Turkey;3. State Key Laboratory, Huazhong University of Science and Technology, Wuhan, China;4. School of Mechatronic Engineering and Automation, Shanghai University, Shanghai 200072, P. R. China |
| |
| Abstract: | This paper considers the lot scheduling problem in the flexible flow shop with limited intermediate buffers to minimize total cost which includes the inventory holding and setup costs. The single available mathematical model by Akrami et al. (2006) for this problem suffers from not only being non-linear but also high size-complexity. In this paper, two new mixed integer linear programming models are developed for the problem. Moreover, a fruit fly optimization algorithm is developed to effectively solve the large problems. For model’s evaluation, this paper experimentally compares the proposed models with the available model. Moreover, the proposed algorithm is also evaluated by comparing with two well-known algorithms (tabu search and genetic algorithm) in the literature and adaption of three recent algorithms for the flexible flow shop problem. All the results and analyses show the high performance of the proposed mathematical models as well as fruit fly optimization algorithm. |
| |
| Keywords: | Lot sizing Scheduling Flexible flow shop Mathematical models Fruit fly algorithm |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
