An Improved Algorithm for Minimizing Makespan on Flowshops with Uncertain Processing Times

Autor:	Muberra Allahverdi, Ali Allahverdi Allahverdi
Rok vydání:	2021
Předmět:	Endüstri Mühendisliği Makespan Scheduling Algorithm Uncertainty Mathematical optimization Job shop scheduling Computer science Industrial Engineering Improved algorithm Scheduling (computing)
Zdroj:	Volume: 13, Issue: 2 521-530 International Journal of Engineering Research and Development
ISSN:	1308-5514
DOI:	10.29137/umagd.887624
Popis:	We address the four-machine flowshop scheduling problem with the objective of minimizing makespan with uncertain processing times The problem was addressed in the literature (RAIRO Operations Research 54, 529-553) and different algorithms were proposed. In this paper, we propose a new algorithm for the problem. The new proposed algorithm is compared with the best algorithm in the literature by using extensive computational experiments. Computational experiments indicate that the new proposed algorithm performs much better than the best algorithm in the literature in terms of error while both have the same computational time. Specifically, the new proposed algorithm reduces the error of the best existing algorithm in the literature over 40%. This result has been confirmed by using tests of hypotheses with a significance level of 0.01.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::75c24afc20d759edbf6396570a140392 https://doi.org/10.29137/umagd.887624 Zobrazit plný text záznamu