A robustness framework for a stochastic hybrild flow shop to minimize the makespan

The robustness of a solution or an algorithm is one of the most new challenges in the scheduling area during the last ten years. It can be studied when the uncertainty should be taken into account. This uncertainty can be involved by some unknown factors such as: machine breakdown, early or tardy arrival times and changes of processing times. The main effort should not only be devoted to find a good solution but also a robust solution which can resist to changes of input data. Therefore we propose, in this paper, a robustness framework to address the problem of scheduling hybrid flow shop under uncertainty. After introducing some concepts related to the robustness, a brief literature review taking into account the robustness is given. Then we introduce a robustness framework for the stochastic hybrid flow shop problem to minimize makespan. Last we focus on validating our models by an experimental study