DC Field | Value | Language |
---|---|---|
dc.contributor.author | Jeong, KC | ko |
dc.contributor.author | Kim, Yeong-Dae | ko |
dc.date.accessioned | 2008-10-28T09:55:06Z | - |
dc.date.available | 2008-10-28T09:55:06Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2000-10 | - |
dc.identifier.citation | COMPUTERS INDUSTRIAL ENGINEERING, v.38, no.3, pp.341 - 360 | - |
dc.identifier.issn | 0360-8352 | - |
dc.identifier.uri | http://hdl.handle.net/10203/7700 | - |
dc.description.abstract | This paper considers a design problem of assembly systems consisting of stations and buffers that connect the stations. We present a solution procedure for finding the minimum cost configuration which gives a desired throughput rate for an assembly system. The configuration is defined by the machines to be used in stations (machine configuration) and capacities of buffers. Three heuristics are proposed, which simultaneously select the machines to be used in the stations and determine the capacities of the buffers. These heuristics start from an initial configuration such as a lower configuration, which consists of less efficient machines and large size buffers, or an upper configuration, which consists of more efficient machines and small size buffers. Then, the heuristics search for a near optimal solution by repeatedly generating promising machine configurations and determining (near) optimal buffer sizes for the machine configurations. Results of computational experiments show that the proposed heuristics give relatively good configurations in a reasonable amount of time. (C) 2000 Elsevier Science Ltd. All rights reserved. | - |
dc.description.sponsorship | This research was supported by the Korea Science and Engineering Foundation under grant 961-1012-095-1. | en |
dc.language | English | - |
dc.language.iso | en_US | en |
dc.publisher | PERGAMON-ELSEVIER SCIENCE LTD | - |
dc.subject | PRODUCTION LINES | - |
dc.subject | UNRELIABLE MACHINES | - |
dc.subject | OPTIMAL ALLOCATION | - |
dc.subject | PROCESSING TIMES | - |
dc.subject | STORAGE SPACE | - |
dc.subject | DESIGN | - |
dc.subject | FORK | - |
dc.subject | THROUGHPUT | - |
dc.subject | CONCAVITY | - |
dc.subject | ALGORITHM | - |
dc.title | Heuristics for selecting machines and determining buffer capacities in assembly systems | - |
dc.type | Article | - |
dc.identifier.wosid | 000165802000003 | - |
dc.identifier.scopusid | 2-s2.0-0034294374 | - |
dc.type.rims | ART | - |
dc.citation.volume | 38 | - |
dc.citation.issue | 3 | - |
dc.citation.beginningpage | 341 | - |
dc.citation.endingpage | 360 | - |
dc.citation.publicationname | COMPUTERS INDUSTRIAL ENGINEERING | - |
dc.embargo.liftdate | 9999-12-31 | - |
dc.embargo.terms | 9999-12-31 | - |
dc.contributor.localauthor | Kim, Yeong-Dae | - |
dc.contributor.nonIdAuthor | Jeong, KC | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | heuristics | - |
dc.subject.keywordAuthor | assembly systems | - |
dc.subject.keywordAuthor | design | - |
dc.subject.keywordPlus | PRODUCTION LINES | - |
dc.subject.keywordPlus | UNRELIABLE MACHINES | - |
dc.subject.keywordPlus | OPTIMAL ALLOCATION | - |
dc.subject.keywordPlus | PROCESSING TIMES | - |
dc.subject.keywordPlus | STORAGE SPACE | - |
dc.subject.keywordPlus | DESIGN | - |
dc.subject.keywordPlus | FORK | - |
dc.subject.keywordPlus | THROUGHPUT | - |
dc.subject.keywordPlus | CONCAVITY | - |
dc.subject.keywordPlus | ALGORITHM | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.