A bicriteria scheduling with sequence-dependent setup times

dc.contributor.authorEren, Tamer
dc.contributor.authorGüner, Ertan
dc.date.accessioned2020-06-25T17:43:29Z
dc.date.available2020-06-25T17:43:29Z
dc.date.issued2006
dc.description.abstractIn this paper a bicriteria scheduling problem with sequence-dependent setup times on a single machine is considered. The objective function of the problem is minimization of the weighted sum of total completion time and total tardiness. An integer programming model is developed for the problem which belongs to NP-hard class. Results of computational tests show that the proposed model is effective in solving problems with up to 12 jobs. For solving problems containing large number of jobs a special heuristic algorithm is proposed. Besides the proposed heuristic algorithm tabu search based heuristic is also used for large jobs problems. To improve the performance of tabu search method the result of the proposed heuristic algorithm is taken as an initial solution of tabu search method. According to computational results both heuristic algorithms are effective in finding problem solutions with up to 1000 jobs. According to the best of our knowledge, no works exists on the minimization of the weighted sum of total completion time and total tardiness with sequence-dependent setup times. (c) 2005 Elsevier Inc. All rights reserved.en_US
dc.identifier.citationclosedAccessen_US
dc.identifier.doi10.1016/j.amc.2005.11.112
dc.identifier.endpage385en_US
dc.identifier.issn0096-3003
dc.identifier.issue1en_US
dc.identifier.scopus2-s2.0-33747373886
dc.identifier.scopusqualityQ1
dc.identifier.startpage378en_US
dc.identifier.urihttps://doi.org10.1016/j.amc.2005.11.112
dc.identifier.urihttps://hdl.handle.net/20.500.12587/3733
dc.identifier.volume179en_US
dc.identifier.wosWOS:000240814500035
dc.identifier.wosqualityQ2
dc.indekslendigikaynakWeb of Science
dc.indekslendigikaynakScopus
dc.language.isoen
dc.publisherElsevier Science Incen_US
dc.relation.ispartofApplied Mathematics And Computation
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectsingle machine schedulingen_US
dc.subjectsequence dependent setup timesen_US
dc.subjectbicriteriaen_US
dc.subject0-1 integer programmingen_US
dc.titleA bicriteria scheduling with sequence-dependent setup timesen_US
dc.typeArticle

Files

Original bundle
Now showing 1 - 1 of 1
[ X ]
Name:
A bicriteria scheduling with sequence-dependent setup times.pdf
Size:
143.65 KB
Format:
Adobe Portable Document Format
Description:
Tam Metin/Full Text