Minimizing total completion time in a two-machine no-wait flowshop with uncertain and bounded setup times

Muberra Allahverdi*, Ali Allahverdi, Bertrand M.T. Lin

*此作品的通信作者

研究成果: Article同行評審

3 引文 斯高帕斯(Scopus)

摘要

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.

原文English
頁(從 - 到)2439-2457
頁數19
期刊Journal of Industrial and Management Optimization
16
發行號5
DOIs
出版狀態Published - 九月 2020

指紋

深入研究「Minimizing total completion time in a two-machine no-wait flowshop with uncertain and bounded setup times」主題。共同形成了獨特的指紋。

引用此