DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Eun-Seok | ko |
dc.contributor.author | Sung, Chang Sup | ko |
dc.contributor.author | Lee, Ik-Sun | ko |
dc.date.accessioned | 2013-03-08T17:30:13Z | - |
dc.date.available | 2013-03-08T17:30:13Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2009 | - |
dc.identifier.citation | COMPUTERS & OPERATIONS RESEARCH, v.36, no.3, pp.698 - 710 | - |
dc.identifier.issn | 0305-0548 | - |
dc.identifier.uri | http://hdl.handle.net/10203/93755 | - |
dc.description.abstract | This paper considers a deterministic scheduling problem where multiple jobs With s-precedence relations are processed on multiple identical parallel machines. The objective is to minimize the total completion time. The s-precedence relation between two jobs i and j represents the situation where job j is constrained from processing until job i starts processing, which is different from the standard definition of a precedence relation where j cannot start until i completes. The s-precedence relation has wide applicability in the real world such as first-come-first-served processing systems. The problem is shown to be intractable, for which a heuristic procedure is derived. Numerical experiments are conducted to show that the derived heuristic provides effective solutions. (C) 2007 Elsevier Ltd. All rights reserved. | - |
dc.language | English | - |
dc.publisher | PERGAMON-ELSEVIER SCIENCE LTD | - |
dc.subject | MEAN FLOW TIME | - |
dc.subject | SINGLE-MACHINE | - |
dc.subject | BOUNDS | - |
dc.subject | ALGORITHMS | - |
dc.subject | ANOMALIES | - |
dc.subject | JOBS | - |
dc.title | Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints | - |
dc.type | Article | - |
dc.identifier.wosid | 000262843000004 | - |
dc.identifier.scopusid | 2-s2.0-53749099771 | - |
dc.type.rims | ART | - |
dc.citation.volume | 36 | - |
dc.citation.issue | 3 | - |
dc.citation.beginningpage | 698 | - |
dc.citation.endingpage | 710 | - |
dc.citation.publicationname | COMPUTERS & OPERATIONS RESEARCH | - |
dc.identifier.doi | 10.1016/j.cor.2007.10.025 | - |
dc.contributor.localauthor | Sung, Chang Sup | - |
dc.contributor.nonIdAuthor | Lee, Ik-Sun | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | Parallel machine scheduling | - |
dc.subject.keywordAuthor | Precedence constraints | - |
dc.subject.keywordAuthor | Total completion time | - |
dc.subject.keywordAuthor | Heuristic | - |
dc.subject.keywordPlus | MEAN FLOW TIME | - |
dc.subject.keywordPlus | SINGLE-MACHINE | - |
dc.subject.keywordPlus | BOUNDS | - |
dc.subject.keywordPlus | ALGORITHMS | - |
dc.subject.keywordPlus | ANOMALIES | - |
dc.subject.keywordPlus | JOBS | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.