DC Field | Value | Language |
---|---|---|
dc.contributor.author | Shim, SO | ko |
dc.contributor.author | Kim, Yeong-Dae | ko |
dc.date.accessioned | 2008-10-07T08:34:45Z | - |
dc.date.available | 2008-10-07T08:34:45Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2007-02 | - |
dc.identifier.citation | EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, v.177, pp.135 - 146 | - |
dc.identifier.issn | 0377-2217 | - |
dc.identifier.uri | http://hdl.handle.net/10203/7518 | - |
dc.description.abstract | This paper focuses on the problem of scheduling n independent jobs on m identical parallel machines for the objective of minimizing total tardiness of the jobs. We develop dominance properties and lower bounds, and develop a branch and bound algorithm using these properties and lower bounds as well as upper bounds obtained from a heuristic algorithm. Computational experiments are performed on randomly generated test problems and results show that the algorithm solves problems with moderate sizes in a reasonable amount of computation time. (c) 2005 Elsevier B.V. All rights reserved. | - |
dc.language | English | - |
dc.language.iso | en_US | en |
dc.publisher | ELSEVIER SCIENCE BV | - |
dc.subject | TOTAL WEIGHTED TARDINESS | - |
dc.subject | BOUND ALGORITHM | - |
dc.subject | BACKWARD APPROACH | - |
dc.subject | MEAN TARDINESS | - |
dc.subject | TABU SEARCH | - |
dc.subject | HEURISTICS | - |
dc.subject | BRANCH | - |
dc.subject | JOBS | - |
dc.subject | TIMES | - |
dc.subject | DATES | - |
dc.title | Scheduling on parallel identical machines to minimize total tardiness | - |
dc.type | Article | - |
dc.identifier.wosid | 000242301100009 | - |
dc.identifier.scopusid | 2-s2.0-33751067267 | - |
dc.type.rims | ART | - |
dc.citation.volume | 177 | - |
dc.citation.beginningpage | 135 | - |
dc.citation.endingpage | 146 | - |
dc.citation.publicationname | EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | - |
dc.identifier.doi | 10.1016/j.ejor.2005.09.038 | - |
dc.embargo.liftdate | 9999-12-31 | - |
dc.embargo.terms | 9999-12-31 | - |
dc.contributor.localauthor | Kim, Yeong-Dae | - |
dc.contributor.nonIdAuthor | Shim, SO | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | scheduling | - |
dc.subject.keywordAuthor | identical parallel machines | - |
dc.subject.keywordAuthor | total tardiness | - |
dc.subject.keywordAuthor | branch and bound algorithm | - |
dc.subject.keywordPlus | TOTAL WEIGHTED TARDINESS | - |
dc.subject.keywordPlus | BOUND ALGORITHM | - |
dc.subject.keywordPlus | BACKWARD APPROACH | - |
dc.subject.keywordPlus | MEAN TARDINESS | - |
dc.subject.keywordPlus | TABU SEARCH | - |
dc.subject.keywordPlus | HEURISTICS | - |
dc.subject.keywordPlus | BRANCH | - |
dc.subject.keywordPlus | JOBS | - |
dc.subject.keywordPlus | TIMES | - |
dc.subject.keywordPlus | DATES | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.