DC Field | Value | Language |
---|---|---|
dc.contributor.author | Jeong, Bong Joo | ko |
dc.contributor.author | Kim, Yeong-Dae | ko |
dc.date.accessioned | 2014-09-01T06:40:40Z | - |
dc.date.available | 2014-09-01T06:40:40Z | - |
dc.date.created | 2014-06-03 | - |
dc.date.created | 2014-06-03 | - |
dc.date.issued | 2014-07 | - |
dc.identifier.citation | COMPUTERS & OPERATIONS RESEARCH, v.47, pp.72 - 80 | - |
dc.identifier.issn | 0305-0548 | - |
dc.identifier.uri | http://hdl.handle.net/10203/189122 | - |
dc.description.abstract | We consider a two-machine re-entrant flowshop scheduling problem in which all jobs must be processed twice on each machine and there are sequence-dependent setup times on the second machine. For the problem with the objective of minimizing total tardiness, we develop dominance properties and a lower bound by extending those for a two-machine re-entrant flowshop problem (without sequence-dependent setup times) as well as heuristic algorithms, and present a branch and bound algorithm in which these dominance properties, lower bound, and heuristics are used. For evaluation of the performance of the branch and bound algorithm and heuristics, computational experiments are performed on randomly generated instances, and results are reported. (C) 2014 Elsevier Ltd. All rights reserved. | - |
dc.language | English | - |
dc.publisher | PERGAMON-ELSEVIER SCIENCE LTD | - |
dc.subject | SCHEDULING PROBLEM | - |
dc.subject | BOUND ALGORITHM | - |
dc.subject | MAKESPAN | - |
dc.subject | MINIMIZATION | - |
dc.subject | HEURISTICS | - |
dc.subject | BRANCH | - |
dc.subject | SHOPS | - |
dc.title | Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times | - |
dc.type | Article | - |
dc.identifier.wosid | 000334982000007 | - |
dc.identifier.scopusid | 2-s2.0-84896744613 | - |
dc.type.rims | ART | - |
dc.citation.volume | 47 | - |
dc.citation.beginningpage | 72 | - |
dc.citation.endingpage | 80 | - |
dc.citation.publicationname | COMPUTERS & OPERATIONS RESEARCH | - |
dc.identifier.doi | 10.1016/j.cor.2014.02.002 | - |
dc.embargo.liftdate | 9999-12-31 | - |
dc.embargo.terms | 9999-12-31 | - |
dc.contributor.localauthor | Kim, Yeong-Dae | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | Scheduling | - |
dc.subject.keywordAuthor | Re-entrant flowshop | - |
dc.subject.keywordAuthor | Sequence-dependent setup times | - |
dc.subject.keywordAuthor | Branch and bound | - |
dc.subject.keywordAuthor | Heuristics | - |
dc.subject.keywordPlus | M-MACHINE | - |
dc.subject.keywordPlus | SCHEDULING PROBLEM | - |
dc.subject.keywordPlus | BOUND ALGORITHM | - |
dc.subject.keywordPlus | MAKESPAN | - |
dc.subject.keywordPlus | MINIMIZATION | - |
dc.subject.keywordPlus | HEURISTICS | - |
dc.subject.keywordPlus | BRANCH | - |
dc.subject.keywordPlus | SHOPS | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.