DC Field | Value | Language |
---|---|---|
dc.contributor.author | Shim, SO | ko |
dc.contributor.author | Kim, Yeong-Dae | ko |
dc.date.accessioned | 2008-10-09T12:53:48Z | - |
dc.date.available | 2008-10-09T12:53:48Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2007-03 | - |
dc.identifier.citation | JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, v.58, pp.346 - 354 | - |
dc.identifier.issn | 0160-5682 | - |
dc.identifier.uri | http://hdl.handle.net/10203/7612 | - |
dc.description.abstract | We consider a problem of scheduling n independent jobs on m unrelated parallel machines with the objective of minimizing total tardiness. Processing times of a job on different machines may be different on unrelated parallel-machine scheduling problems. We develop several dominance properties and lower bounds for the problem, and suggest a branch and bound algorithm using them. Results of computational experiments show that the suggested algorithm gives optimal solutions for problems with up to five machines and 20 jobs in a reasonable amount of CPU time. | - |
dc.language | English | - |
dc.language.iso | en_US | en |
dc.publisher | PALGRAVE MACMILLAN LTD | - |
dc.subject | TOTAL WEIGHTED TARDINESS | - |
dc.subject | BACKWARD APPROACH | - |
dc.subject | JOBS | - |
dc.subject | HEURISTICS | - |
dc.subject | ALGORITHMS | - |
dc.title | Minimizing total tardiness in an unrelated parallel-machine scheduling problem | - |
dc.type | Article | - |
dc.identifier.wosid | 000244338100008 | - |
dc.identifier.scopusid | 2-s2.0-33846885666 | - |
dc.type.rims | ART | - |
dc.citation.volume | 58 | - |
dc.citation.beginningpage | 346 | - |
dc.citation.endingpage | 354 | - |
dc.citation.publicationname | JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY | - |
dc.identifier.doi | 10.1057/palgrave.jors.2602141 | - |
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 | unrelated parallel machines | - |
dc.subject.keywordAuthor | total tardiness | - |
dc.subject.keywordAuthor | branch and bound | - |
dc.subject.keywordPlus | TOTAL WEIGHTED TARDINESS | - |
dc.subject.keywordPlus | BACKWARD APPROACH | - |
dc.subject.keywordPlus | JOBS | - |
dc.subject.keywordPlus | HEURISTICS | - |
dc.subject.keywordPlus | ALGORITHMS | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.