Show simple item record

dc.contributor.authorNewton, MA Hakim
dc.contributor.authorRiahi, Vahid
dc.contributor.authorSattar, Abdul
dc.date.accessioned2019-10-30T23:18:42Z
dc.date.available2019-10-30T23:18:42Z
dc.date.issued2019
dc.identifier.issn0305-0548
dc.identifier.doi10.1016/j.cor.2019.07.013
dc.identifier.urihttp://hdl.handle.net/10072/388763
dc.description.abstractBlocking constraints are ubiquitous in machine scheduling. In a flowshop scenario, a machine might get blocked by a job that has just been processed by the same machine. This happens when there is no buffer where the job can temporarily go before the next machine is available to process it. This also happens when two successive machines depend on a mutually exclusive resource to process the same job. In this paper, we show that under certain conditions, two successive machines operating under blocking constraints involving mutually exclusive resources can virtually be treated as a joint machine. Before performing search, we then use this makespan preserving property in reengineering a permutation flowshop. The reengineered flowshop model can actually be used by any arbitrary search algorithm to improve efficiency. We show an example of machine conjoining in the waste treatment industry. We also empirically show that such reengineering helps state-of-the-art flowshop search algorithms obtain significantly better makespan values than when the original model is used. Flowshop reengineering is appealing particularly because it helps obtain a higher abstraction level and any search algorithm can use it as a preprocessing step.
dc.description.peerreviewedYes
dc.languageEnglish
dc.publisherElsevier
dc.publisher.placeUnited Kingdom
dc.relation.ispartofpagefrom104755: 1
dc.relation.ispartofpageto104755: 11
dc.relation.ispartofjournalComputers & Operations Research
dc.relation.ispartofvolume112
dc.subject.fieldofresearchApplied Mathematics
dc.subject.fieldofresearchNumerical and Computational Mathematics
dc.subject.fieldofresearchcode0102
dc.subject.fieldofresearchcode0103
dc.subject.keywordsScience & Technology
dc.subject.keywordsTechnology
dc.subject.keywordsComputer Science, Interdisciplinary Applications
dc.subject.keywordsEngineering, Industrial
dc.subject.keywordsOperations Research & Management Science
dc.titleMakespan preserving flowshop reengineering via blocking constraints
dc.typeJournal article
dc.type.descriptionC1 - Articles
dcterms.bibliographicCitationNewton, MAH; Riahi, V; Sattar, A, Makespan preserving flowshop reengineering via blocking constraints, Computers & Operations Research, 2019, 112, pp. 104755: 1-104755: 11
dcterms.licensehttp://creativecommons.org/licenses/by-nc-nd/4.0/
dc.date.updated2019-10-25T05:10:35Z
dc.description.versionPost-print
gro.rights.copyright© 2019 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.authorRiahi, Vahid
gro.griffith.authorNewton, MAHakim A.


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