Online supplement to:
Benavides, A. J. & Zea, G. R. (xxxx). Faster methods for the flow shop scheduling with heterogeneous workers. European Journal of Operational Research, xxx(x), xxx-xxx. doi: xxxxxx/xxxxxxxxxxxxx.
In a flow shop production line, the machines are not always completely automated. They may be workstations which performance may directly depend on the worker assigned to it. The heterogeneous flow shop scheduling problem (Het-FSSP) is composed of two subproblems that must be solved together: the assignment of workers with different capabilities to workstation machines, and the scheduling of jobs in that flow shop. This environment is inspired in sheltered work-centers for disabled, where workers in the production line show different capabilities, i.e., the processing time of a job on a machine depends on the worker assigned to that machine. This paper proposes a new constraint programming model and a new hybrid scatter search with non-permutational iterated greedy method to solve the Het-FSSP. The proposed methods show better results than previous methods from the literature and show that it is possible to produce non-permutational schedules for other variants of flow shop problems without increasing the computational time.
@article{Benavides20xxhetFSSP,
title={Faster methods for the flow shop scheduling with heterogeneous workers},
author={Benavides, Alexander J. and Zea, Giuliana R.},
journal={European Journal of Operational Research},
year={xxxx},
volume={xxx},
number={x},
pages={xxx--xxx},
publisher={Elsevier},
doi={xxxxxx/xxxxxxxxxxx}
}
Alexander J. Benavides, Giuliana R. Zea.
Below you can download the following data files for the heterogeneous flow shop scheduling problem: