Minimizing total completion time in a two-machine no-wait flowshop with uncertain and bounded setup times
We address a two-machine no-wait flowshop scheduling problem with respect to the performance measure of total completion time. Minimizing total completion time is important when inventory cost is of concern. Setup times are treated separately from processing times. Furthermore, setup times are uncertain with unknown distributions and are within some lower and upper bounds. We develop a dominance relation and propose eight algorithms to solve the problem. The proposed algorithms, which assign different weights to the processing and setup times on both machines, convert the two-machine problem into a single-machine one for which an optimal solution is known. We conduct computational experiments to evaluate the proposed algorithms. Computational experiments reveal that one of the proposed algorithms, which assigns the same weight to setup and processing times, is superior to the rest of the algorithms. The results are statistically verified by constructing confidence intervals and test of hypothesis.
Journal of Industrial and Management Optimization
First Page Number
Last Page Number
Allahverdi, Muberra; Allahverdi, Ali; and Lin, Bertrand M.T., "Minimizing total completion time in a two-machine no-wait flowshop with uncertain and bounded setup times" (2020). Kean Publications. 1188.