MILP-based local search procedures for minimizing total tardiness in the No-idle Permutation Flowshop Problem

Simple item page
dc.contributor.authorBalogh, Andrea
dc.contributor.authorGarraffa, Michele
dc.contributor.authorO'Sullivan, Barry
dc.contributor.authorSalassa, Fabio
dc.contributor.funderScience Foundation Irelanden
dc.contributor.funderEuropean Regional Development Funden
dc.date.accessioned2022-06-14T10:00:20Z
dc.date.available2022-06-14T10:00:20Z
dc.date.issued2022-05-17
dc.date.updated2022-06-14T09:54:57Z
dc.description.abstractWe consider the No-idle Permutation Flowshop Scheduling Problem (NPFSP) with a total tardiness criterion. We present two Mixed Integer Linear Programming (MILP) formulations based on positional and precedence variables, respectively. We study six local search procedures that explore two different neighborhoods by exploiting the MILP formulations. Our computational experiments show that two of the proposed procedures strongly outperform the state-of-the-art metaheuristic. We update 63% of the best known solutions of the instances in Taillards’ benchmark, and 77% if we exclude those instances for which we proved that the previous best known solutions are optimal.en
dc.description.sponsorshipScience Foundation Ireland (SFI under grant number 16/RC/3918 (Confirm) and 12/RC/2289-P2 (Insight), and co-funded under the European Regional Development Fund)en
dc.description.statusPeer revieweden
dc.description.versionPublished Versionen
dc.format.mimetypeapplication/pdfen
dc.identifier.articleid105862en
dc.identifier.citationBalogh, A., Garraffa, M., O'Sullivan, B. and Salassa, F. (2022) 'MILP-based local search procedures for minimizing total tardiness in the No-idle Permutation Flowshop Problem', Computers & Operations Research, 146, 105862 (15 pp). doi: 10.1016/j.cor.2022.105862en
dc.identifier.doi10.1016/j.cor.2022.105862en
dc.identifier.endpage15en
dc.identifier.issn0305-0548
dc.identifier.journaltitleComputers & Operations Researchen
dc.identifier.startpage1en
dc.identifier.urihttps://hdl.handle.net/10468/13294
dc.identifier.volume146en
dc.language.isoenen
dc.publisherElsevieren
dc.relation.projectinfo:eu-repo/grantAgreement/SFI/SFI Research Centres/12/RC/2289/IE/INSIGHT - Irelands Big Data and Analytics Research Centre/en
dc.relation.urihttps://doi.org/10.1016/j.cor.2022.105862
dc.rights© 2022 The Author(s). Published by Elsevier Ltd. This is an open access article under the CC BY licenseen
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/en
dc.subjectSchedulingen
dc.subjectFlowshopen
dc.subjectNo-idleen
dc.subjectMILPen
dc.subjectHybrid heuristicsen
dc.titleMILP-based local search procedures for minimizing total tardiness in the No-idle Permutation Flowshop Problemen
dc.typeArticle (peer-reviewed)en
Files
Original bundle
Now showing 1 - 2 of 2
Thumbnail Image
Name:
1-s2.0-S0305054822001368-main.pdf
Size:
850.3 KB
Format:
Adobe Portable Document Format
Description:
Published version
Download
Thumbnail Image
Name:
1-s2.0-S0305054822001368-mmc1.xlsx
Size:
8.46 KB
Format:
Microsoft Excel XML
Description:
Supplementary data
Download
License bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
2.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Computer Science - Journal Articles
Insight Centre for Data Analytics - Journal Articles