Minimizing total completion time for flowshop scheduling problem with uncertain processing times

Allahverdi, Muberra; Allahverdi, Ali

doi:10.1051/ro/2020022

Cited by 5 publications

(6 citation statements)

References 28 publications

(29 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Ten algorithms are proposed to minimize TCT with uncertain processing times, and one of them is established as the best performing algorithm with the lowest TCT. In this paper, we develop a new algorithm using the python programming language which is substantially better than the best algorithm given in Allahverdi and Allahverdi (2020). We confirm the effectiveness of the new algorithm through computational methods and statistical inference.…”

Section: Introductionmentioning

confidence: 63%

“…The problem of a four machine flowshop with the objective of minimizing TCT with uncertain processing times was addressed by Allahverdi and Allahverdi (2020). They proposed different algorithms to solve the problem and showed that one of the algorithms performs the best.…”

Section: A New Algorithmmentioning

confidence: 99%

“…They proposed different algorithms to solve the problem and showed that one of the algorithms performs the best. In this section, we propose a new algorithm and show that the new algorithm significantly outperforms the best algorithm of Allahverdi and Allahverdi (2020).…”

Section: A New Algorithmmentioning

confidence: 99%

“…We follow the algorithm outlined in Section 2, New Algorithm, with Formula 2 above and conduct computational experiments to compare the new algorithm to the best algorithm given in Allahverdi and Allahverdi (2020).…”

Section: Comparing the Proposed Algorithm (New-alg) And The Existing ...mentioning

confidence: 99%

“…Finally, Allahverdi and Allahverdi (2020) addresses the four machine flowshop scheduling problem to minimize TCT with uncertain processing times. Ten algorithms are proposed to minimize TCT with uncertain processing times, and one of them is established as the best performing algorithm with the lowest TCT.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

A Substantially Improved New Algorithm for Flowshop Scheduling Problem with Uncertain Processing Times

Allahverdi¹

2022

Uluslararası Muhendislik Arastirma Ve Gelistirme Dergisi

View full text Add to dashboard Cite

The performance measure of total completion time (TCT) plays a key role in manufacturing to improve performance, e.g., reducing inventory levels. Moreover, since uncertainty is an inevitable part of certain manufacturing environments, it is especially important to address cases with uncertain processing times. This paper addresses the four-machine flowshop scheduling problem to minimize TCT with uncertain processing times. Due to the NP-hardness of the problem, different algorithms were presented as solutions in scheduling literature. In this paper, a new substantially improved algorithm is proposed and parameters of the algorithm are fine tuned. The proposed algorithm is compared to the best existing algorithm (RAIRO Operations Research 54, 529-553, 2020) in scheduling literature using extensive computational experiments and statistical analysis. Computational methods using the programming language python, along with statistical inference, is used to confirm the effectiveness of the proposed algorithm over the existing ones. Computational methods reveal that the proposed algorithm is, on average, 86.8% more effective than the best existing one in literature with similar computational times. A test of hypothesis further confirms the effectiveness of the proposed algorithm with a p-value of less than 0.00001, which is practically zero.

show abstract

Section: Introductionmentioning

confidence: 63%

Section: A New Algorithmmentioning

confidence: 99%

Section: A New Algorithmmentioning

confidence: 99%

Section: Comparing the Proposed Algorithm (New-alg) And The Existing ...mentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

A Substantially Improved New Algorithm for Flowshop Scheduling Problem with Uncertain Processing Times

Allahverdi¹

2022

Uluslararası Muhendislik Arastirma Ve Gelistirme Dergisi

View full text Add to dashboard Cite

show abstract

Single machine scheduling with uncertain processing times and carbon emission constraint in the shared manufacturing environment

Zheng,

Wang,

et al. 2023

Ann Oper Res

View full text Add to dashboard Cite

Minimizing total tardiness in a two-machine flowshop with uncertain and bounded processing times

Allahverdi¹

2023

RAIRO-Oper. Res.

View full text Add to dashboard Cite

The two-machine flowshop scheduling problem with the performance measure of total tardiness is addressed. This performance measure is essential since meeting deadlines is a crucial part of scheduling and a major concern for some manufacturing systems. The processing times on both machines are uncertain variables and within some lower and upper bounds. This is due to uncertainty being an integral part of some manufacturing settings, making it impossible to predict processing times in advance. To the best of the author’s knowledge, this problem is addressed for the first time in this paper. A dominance relation is established and nineteen algorithms, which incorporate the established dominance relation, are presented. These algorithms are extensively evaluated through randomly generated data for different numbers of jobs and four different distributions, representing both symmetric and non-symmetric distributions. Computational experiments show that the presented algorithms perform extremely well when compared with a random solution. In particular, the best of the considered 19 algorithms reduces the error of the random solution by 99.99% and the error of the worst algorithm (among the 19 algorithms) by 99.96%. The results are confirmed by a test of hypothesis and this algorithm is recommended.

show abstract

Minimizing total completion time for flowshop scheduling problem with uncertain processing times

Cited by 5 publications

References 28 publications

A Substantially Improved New Algorithm for Flowshop Scheduling Problem with Uncertain Processing Times

A Substantially Improved New Algorithm for Flowshop Scheduling Problem with Uncertain Processing Times

Single machine scheduling with uncertain processing times and carbon emission constraint in the shared manufacturing environment

Minimizing total tardiness in a two-machine flowshop with uncertain and bounded processing times

Contact Info

Product

Resources

About