DC Field | Value | Language |
---|---|---|
dc.contributor.author | Sung, Chang Sup | ko |
dc.date.accessioned | 2013-02-27T12:09:32Z | - |
dc.date.available | 2013-02-27T12:09:32Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 1997-04 | - |
dc.identifier.citation | COMPUTERS & INDUSTRIAL ENGINEERING, v.32, no.1, pp.9 - 17 | - |
dc.identifier.issn | 0360-8352 | - |
dc.identifier.uri | http://hdl.handle.net/10203/68484 | - |
dc.description.abstract | This paper introduces a solution algorithm derived and based on branch-and-bound procedures to solve a generally-classified resource-constrained project scheduling problem where various operating modes are allowed to perform each activity in the project and all activities are non-preemptive. With the objective of minimizing the makespan of the project, two lower bound computation procedures are derived for the associated tree search algorithm where a depth-first search strategy is employed. An efficient heuristic algorithm for large-size problems is also exploited by using partly the branch-and-bound algorithm. Both algorithms are tested with various numerical problems for their effectiveness and efficiences. Copyright (C) 1997 Elsevier Science Ltd | - |
dc.language | English | - |
dc.publisher | Pergamon-Elsevier Science Ltd | - |
dc.subject | ALGORITHM | - |
dc.subject | BRANCH | - |
dc.title | A Scheduling Procedure for a General Class of Resource-Constrained Projects | - |
dc.type | Article | - |
dc.identifier.wosid | A1997WF28900002 | - |
dc.identifier.scopusid | 2-s2.0-0030780331 | - |
dc.type.rims | ART | - |
dc.citation.volume | 32 | - |
dc.citation.issue | 1 | - |
dc.citation.beginningpage | 9 | - |
dc.citation.endingpage | 17 | - |
dc.citation.publicationname | COMPUTERS & INDUSTRIAL ENGINEERING | - |
dc.contributor.localauthor | Sung, Chang Sup | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordPlus | ALGORITHM | - |
dc.subject.keywordPlus | BRANCH | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.