(The) U-line line balancing problem with the moving time of operatorU자형 라인에서 작업자 이동시간을 고려한 라인밸런싱에 관한 연구

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 713
  • Download : 0
Compared with the straight-line line balancing problem, the problem with U-line is more complicated because tasks can be grouped by moving forward, backward, or simultaneously in both directions, through the precedence network. In this thesis, the U-line line balancing problem is studied in two cases depending on whether the moving time of operator is considered(CASE II) or not(CASE I). The moving time occurs when he moves from one machine to another to carry out the assigned tasks at his workstation during a given cycle time. For each case, the problem is formulated into the mathematical programming model. Due to its problem complexity, we develop two heuristic algorithms based on the simulated annealing search method and the PATH search method. To show the validity of the proposed algorithms, example problems are solved. The results are compared with an existing algorithm for the CASE I. For the CASE II problem, we suggest a lower bound of an optimal solution.
Advisors
Hwang, Harkresearcher황학researcher
Description
한국과학기술원 : 산업공학과,
Publisher
한국과학기술원
Issue Date
1996
Identifier
105299/325007 / 000943366
Language
eng
Description

학위논문(석사) - 한국과학기술원 : 산업공학과, 1996.2, [ ii, 49 p. ]

Keywords

Simulated Annealing; U-line Line Balancing; PATH algorithm; 작업자 이동시간; 라인밸런싱; U자형 라인; Moving Time

URI
http://hdl.handle.net/10203/41475
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=105299&flag=dissertation
Appears in Collection
IE-Theses_Master(석사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0