An improved algorithm to minimize the total completion time in a two-machine no-wait flowshop with uncertain setup times

Document Type

Article

Publication Date

1-1-2022

Abstract

Since scheduling literature has a wide range of uncertainties, it is crucial to take these into ac-count when solving performance measure problems. Otherwise, the performance may severely be affected in a negative way. In this paper, an algorithm is proposed to minimize the total completion time (TCT) of a two-machine no-wait flowshop with uncertain setup times within lower and upper bounds. The results are compared to the best existing algorithm in scheduling literature: the programming language Python is used to generate random samples with respect to various distributions, and the TCT of the proposed algorithm is compared to that of the best existing one. Results reveal that the proposed one significantly outperforms the best one given in literature for all considered distributions. Specifically, the average percentage improvement of the proposed algorithm over the best existing one is over 90%. A test of hypothesis is con-ducted to further confirm the results.

Publication Title

Journal of Project Management (Canada)

First Page Number

1

Last Page Number

12

DOI

10.5267/j.jpm.2021.9.001

This document is currently not available here.

Share

COinS