A heuristic for an assembly line balancing problem with incompatibility, range, and partial precedence constraints

This paper considers a new type of an assembly line balancing problem which occurs in a company manufacturing electronic home appliances. The problem has some special characteristics. The main difficulty in this problem is that the precedence diagram is not enough to describe the precedence relationships between the tasks. It is shown that the usual line balancing model is a special case of the problem considered in this paper. After considering two subproblems, a heuristic algorithm for the problem is proposed. The algorithm is based on some network theories. Computational results based on some real world problems show the proposed algorithm works well in practice. A full system which incorporates graphic user interface is developed and currently in use. (C) 1997 Elsevier Science Ltd.
Publisher
PERGAMON-ELSEVIER SCIENCE LTD
Issue Date
1997-04
Language
ENG
Citation

COMPUTERS INDUSTRIAL ENGINEERING, v.32, no.2, pp.321 - 332

ISSN
0360-8352
DOI
10.1016/S0360-8352(96)00301-4
URI
http://hdl.handle.net/10203/7556
Appears in Collection
IE-Journal Papers(저널논문)
  • Hit : 486
  • Download : 7
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button
⊙ Cited 19 items in WoSClick to see citing articles inrecords_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0