@inproceedings{336c5fc48ac94fb4a5802f60c75c80ed,
title = "An improved procedure for solving minimum makespan on a flowshop",
abstract = "This paper presents numerous heuristics, derived from the NEH heuristic, aimed at minimizing the classical permutation flowshop scheduling problem. We compare the solution, based on Taillard's benchmark problems. We propose a better schedule by comparing these heuristics and identifying common partial sequences of consecutive jobs. We identify the closest heuristic to our result by using a standard distance measure used in the literature. We use this heuristic as an initial solution for a further standard improvement procedure. The obtained average relative percentage deviation values of our procedure is within a reasonable computational effort and appears to improve the published results on these problem sets.",
keywords = "Flowshop, Heuristics, Makespan, Processing time, Scheduling",
author = "David Freud and Amir Elalouf",
note = "Publisher Copyright: {\textcopyright} 2022 IEEE.; 8th International Conference on Control, Decision and Information Technologies, CoDIT 2022 ; Conference date: 17-05-2022 Through 20-05-2022",
year = "2022",
month = jan,
day = "1",
doi = "10.1109/codit55151.2022.9804143",
language = "الإنجليزيّة",
series = "2022 8th International Conference on Control, Decision and Information Technologies, CoDIT 2022",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "1630--1634",
booktitle = "2022 8th International Conference on Control, Decision and Information Technologies, CoDIT 2022",
address = "الولايات المتّحدة",
}