Heuristics for selecting machines and determining buffer capacities in assembly systems

Cited 23 time in webofscience Cited 0 time in scopus
  • Hit : 791
  • Download : 12
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.
Publisher
PERGAMON-ELSEVIER SCIENCE LTD
Issue Date
2000-10
Language
English
Article Type
Article
Keywords

PRODUCTION LINES; UNRELIABLE MACHINES; OPTIMAL ALLOCATION; PROCESSING TIMES; STORAGE SPACE; DESIGN; FORK; THROUGHPUT; CONCAVITY; ALGORITHM

Citation

COMPUTERS INDUSTRIAL ENGINEERING, v.38, no.3, pp.341 - 360

ISSN
0360-8352
URI
http://hdl.handle.net/10203/7700
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 23 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0