The tricriteria flowshop scheduling problem

dc.contributor.authorEren, Tamer
dc.contributor.authorGuner, Ertan
dc.date.accessioned2020-06-25T17:44:47Z
dc.date.available2020-06-25T17:44:47Z
dc.date.issued2008
dc.description.abstractMulticriteria flowshop scheduling problems have been one of the most attractive subjects in recent years. In the multicriteria flowshop scheduling literature, a very limited number of studies have been performed on problems which include a tardiness criterion. In this paper a multicriteria (tricriteria) two-machine flowshop scheduling problem with a tardiness criterion is tackled. The objective is to minimise a weighted sum of total completion time, total tardiness and makespan. An integer programming model is proposed for the problem which belongs to NP-hard class. The modified NEH (Nawaz, Enscore and Ham) algorithm, a tabu search-based heuristic method, random search and the EDD rule (the earliest due date rule) are used to solve problems with up to 2,500 jobs. A computational analysis is conducted to evaluate the performance of the heuristics. The analysis shows that the heuristics are quite efficient, and the performance of the tabu search based heuristic is the best of all in terms of solution quality.en_US
dc.identifier.citationclosedAccessen_US
dc.identifier.doi10.1007/s00170-007-0931-1
dc.identifier.endpage1220en_US
dc.identifier.issn0268-3768
dc.identifier.issue11-12en_US
dc.identifier.scopus2-s2.0-43449107101
dc.identifier.scopusqualityQ1
dc.identifier.startpage1210en_US
dc.identifier.urihttps://doi.org10.1007/s00170-007-0931-1
dc.identifier.urihttps://hdl.handle.net/20.500.12587/4194
dc.identifier.volume36en_US
dc.identifier.wosWOS:000254253000016
dc.identifier.wosqualityQ3
dc.indekslendigikaynakWeb of Science
dc.indekslendigikaynakScopus
dc.language.isoen
dc.publisherSpringer London Ltden_US
dc.relation.ispartofInternational Journal Of Advanced Manufacturing Technology
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectflowshop schedulingen_US
dc.subjecttricriteriaen_US
dc.subjectinteger programmingen_US
dc.subjectheuristic methodsen_US
dc.titleThe tricriteria flowshop scheduling problemen_US
dc.typeArticle

Dosyalar

Orijinal paket
Listeleniyor 1 - 1 / 1
[ X ]
İsim:
The tricriteria flowshop scheduling problem.pdf
Boyut:
226.29 KB
Biçim:
Adobe Portable Document Format
Açıklama:
Tam Metin/Full Text