Show simple item record

dc.contributor.authorRiahi, V
dc.contributor.authorNewton, MAH
dc.contributor.authorSattar, A
dc.date.accessioned2021-05-23T22:43:00Z
dc.date.available2021-05-23T22:43:00Z
dc.date.issued2021
dc.identifier.issn0952-1976
dc.identifier.doi10.1016/j.engappai.2021.104264
dc.identifier.urihttp://hdl.handle.net/10072/404565
dc.description.abstractPermutation flowshop scheduling problem with sequence-dependent setup times (PFSP-SDST) and makespan minimisation is NP-hard. It has important practical applications, for example, in the cider industry and the print industry. There exist several metaheuristic algorithms to solve this problem. However, within practical time limits, those algorithms still either find low quality solutions or struggle with large problems. In this paper, we have proposed a simple but effective local search algorithm, called constraint based local search (CBLS) algorithm, which transforms the SDST constraints into an auxiliary objective function and uses the auxiliary objective function to guide the search towards the optimal value of the actual objective function. Our motivation comes from the constraint optimisation models in artificial intelligence (AI), where constraint-based informed decisions are of particular interest instead of random-based decisions. Our experimental results on well-known 480 instances of PFSP-SDST show that the proposed CBLS algorithm outperforms existing state-of-the-art PFSP-SDST algorithms. Moreover, our algorithm obtains new upper bounds for 204 out of 360 medium- and large-sized problem instances.
dc.description.peerreviewedYes
dc.languageen
dc.publisherElsevier BV
dc.relation.ispartofpagefrom104264
dc.relation.ispartofjournalEngineering Applications of Artificial Intelligence
dc.relation.ispartofvolume102
dc.subject.fieldofresearchInformation and Computing Sciences
dc.subject.fieldofresearchEngineering
dc.subject.fieldofresearchcode08
dc.subject.fieldofresearchcode09
dc.titleConstraint based local search for flowshops with sequence-dependent setup times
dc.typeJournal article
dc.type.descriptionC1 - Articles
dcterms.bibliographicCitationRiahi, V; Newton, MAH; Sattar, A, Constraint based local search for flowshops with sequence-dependent setup times, Engineering Applications of Artificial Intelligence, 2021, 102, pp. 104264
dcterms.licensehttps://creativecommons.org/licenses/by-nc-nd/4.0/
dc.date.updated2021-05-21T00:50:29Z
dc.description.versionAccepted Manuscript (AM)
gro.rights.copyright© 2021 Elsevier. Licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International Licence (http://creativecommons.org/licenses/by-nc-nd/4.0/) which permits unrestricted, non-commercial use, distribution and reproduction in any medium, providing that the work is properly cited.
gro.hasfulltextFull Text
gro.griffith.authorSattar, Abdul
gro.griffith.authorNewton, MAHakim A.
gro.griffith.authorRiahi, Vahid


Files in this item

This item appears in the following Collection(s)

  • Journal articles
    Contains articles published by Griffith authors in scholarly journals.

Show simple item record