Genetic algorithm-based heuristic for capacitated lotsizing problem in flow shops with sequence-dependent setups

Authors:
M. Mohammadi;S. M. T. Fatemi Ghomi
Affiliations:
Department of Industrial Engineering, Faculty of Engineering, Tarbiat Moallem University, Karaj, Iran;Department of Industrial Engineering, Amirkabir University of Technology, 424, Hafez Avenue, 15916-34311 Tehran, Iran
Venue:
Expert Systems with Applications: An International Journal
Year:
2011

Citing 5
Cited 0

Solving multi-item capacitated lot-sizing problems using variable redefinition

Operations Research
Joint rolling-horizon scheduling of materials processing and lot-sizing with sequence-dependent setups

Journal of Heuristics
Lot sizing and furnace scheduling in small foundries

Computers and Operations Research
Rolling-horizon and fix-and-relax heuristics for the parallel machine lot-sizing and scheduling problem with sequence-dependent set-up costs

Computers and Operations Research
A Constructive Genetic Algorithm for permutation flowshop scheduling

Computers and Industrial Engineering

Quantified Score

Hi-index	12.05

Visualization

Abstract

This paper proposes a genetic algorithm-based heuristic for the capacitated lotsizing problem in flow shops with sequence-dependent setups. The proposed heuristic combines genetic algorithm with rolling horizon approach. To evaluate the effectiveness of the proposed heuristic, some numerical experiments are conducted and corresponding results are compared with those of previously developed heuristics by authors. The comparative results indicate the superiority of genetic algorithm-based heuristic specially in solving the large-sized problem instances.