Journal
APPLIED SOFT COMPUTING
Volume 80, Issue -, Pages 904-919Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.asoc.2019.03.054
Keywords
Lot sizing; Scheduling; Flexible flow shop; Mathematical models; Fruit fly algorithm
Ask authors/readers for more resources
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. (C) 2019 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available