Production in a two-machine flowshop scheduling environment with uncertain processing and setup times to minimize makespan

A wide range of uncertainties exists in some real-world production environments which result in uncertain setup and/or processing times. Factors such as crew skills, shortages in equipment and resource breakdowns can be the sources of these uncertainties. This study considers a two-machine production flowshop scheduling problem where both setup and processing times are treated as uncertain variables. The objective is to minimise makespan which is an effective way of resource utilisation. There exists a dominance relation in the literature for the two-machine flowshop scheduling problem with uncertain setup and processing times. However, the dominance relation has not been evaluated. In this study, we evaluate the existing dominance relation. Moreover, a new dominance relation is established and shown to be more effective than the existing one. Furthermore, twenty-five implementations of a polynomial time algorithm are developed. Extensive computational experiments are conducted to evaluate the performance of the implementations of the algorithm. The computational experiments indicate that the overall gap (error) of the best implementation of the algorithm is less than 0.3% when compared to the optimal solution. Moreover, the performance of this implementation of the algorithm is the best one when compared to the remaining implementations for all the considered experimental environments. Additionally, the performance of this implementation of the algorithm is shown to be insensitive to the uncertainty in setup times.