This paper proposes a new constructive heuristic for the flow shop scheduling problem with total flow time minimization. First, we review and analyse the existing methods proposed in the literature. We evaluate the strengths and weaknesses of each method to design a new constructive heuristic for the problem. The computational evaluation shows the better performance of the proposed method when compared to previous methods from the literature.
@article{Benavides20xxFSSPcsum,
title={New constructive heuristic for flow shop scheduling with total completion time},
author={Benavides, Alexander J. and Alave, M. M., and Valenzuela, D. V.},
journal={European Journal of Operational Research},
year={xxxx},
volume={xxx},
number={x},
pages={xxx--xxx},
publisher={Elsevier},
doi={xxxxxx/xxxxxxxxxxx}
}