Show simple item record

dc.contributor.authorRiahi, V
dc.contributor.authorNewton, MAH
dc.contributor.authorSattar, A
dc.date.accessioned2020-04-07T00:13:50Z
dc.date.available2020-04-07T00:13:50Z
dc.date.issued2019
dc.identifier.isbn9783030299101
dc.identifier.issn0302-9743
dc.identifier.doi10.1007/978-3-030-29911-8_29
dc.identifier.urihttp://hdl.handle.net/10072/393006
dc.description.abstractMakespan minimisation of permutation flowshop scheduling problems (PFSP) with sequence dependent setup times (SDST) is NP-Hard. PFSP-SDST has important practical applications e.g. in the paint industry. There exist several algorithms for PFSP-SDST, but they just use generic methods that lack specific structural information of the problem and so struggle with large-sized problems or find low quality solutions. In this paper, we propose a constraint-directed local search (CDLS) algorithm, which takes SDST constraints into account. SDSTs cause delays in job processing and directly affect the makespan. The PFSP-SDST solving algorithms should therefore explicitly incorporate these constraints in their search decisions. In this paper, we define a measurement of delays created by SDST constraints. The CDLS algorithm then gives priorities to the jobs that cause the highest delays since these jobs are in the most problematic parts of the solution. Our experimental results on 220 well-known instances show that the CDLS algorithm significantly outperforms the existing state-of-the-art algorithms. Moreover, it obtains new upper bounds for 163 instances out of those 220.
dc.description.peerreviewedYes
dc.publisherSpringer
dc.relation.ispartofconferencename16th Pacific Rim International Conference on Artificial Intelligence (PRICAI 2019): Trends in Artificial Intelligence
dc.relation.ispartofconferencetitleLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.relation.ispartofdatefrom2019-08-26
dc.relation.ispartofdateto2019-08-30
dc.relation.ispartoflocationCuvu, Yanuca Island, Fiji
dc.relation.ispartofpagefrom379
dc.relation.ispartofpageto392
dc.relation.ispartofseriesLecture Notes in Computer Science
dc.relation.ispartofvolume11671
dc.subject.fieldofresearchArtificial intelligence
dc.subject.fieldofresearchcode4602
dc.titleExploiting Setup Time Constraints in Local Search for Flowshop Scheduling
dc.typeConference output
dc.type.descriptionE1 - Conferences
dcterms.bibliographicCitationRiahi, V; Newton, MAH; Sattar, A, Exploiting Setup Time Constraints in Local Search for Flowshop Scheduling, PRICAI 2019: Trends in Artificial Intelligence, 2019, 11671, pp. 379-392
dc.date.updated2020-04-06T23:57:49Z
gro.hasfulltextNo Full Text
gro.griffith.authorSattar, Abdul


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

  • Conference outputs
    Contains papers delivered by Griffith authors at national and international conferences.

Show simple item record