Please use this identifier to cite or link to this item:
|Title:||A bidirectional heuristic for stochastic assembly line balancing type II problem||Authors:||Liu, S.B.
|Keywords:||Assembly line balancing problem
|Issue Date:||Jan-2005||Citation:||Liu, S.B., Ong, H.L., Huang, H.C. (2005-01). A bidirectional heuristic for stochastic assembly line balancing type II problem. International Journal of Advanced Manufacturing Technology 25 (1-2) : 71-77. ScholarBank@NUS Repository. https://doi.org/10.1007/s00170-003-1833-5||Abstract:||In this paper, a heuristic algorithm is proposed to solve the single-model stochastic assembly line balancing Type II problem. For a given number of workstations and a pre-specified assembly line reliability, which is the probability of the work-load not exceeding the cycle time for the whole assembly line, the proposed algorithm tries to obtain a solution with the smallest cycle time. In the first stage, the tasks are assigned to workstations from the forward and backward directions alternatively. In the second stage, the workload is smoothed by swapping tasks among workstations. At last, the upper bound of the cycle time obtained in the second stage is reduced step by step until the smallest cycle time satisfies the pre-specified assembly line reliability. The performance of the proposed algorithm is compared with a modified version of Moodie and Young's algorithm by applying them to some literature problems. The computational results show that the proposed algorithm is efficient in minimizing the cycle time for the single-model stochastic assembly line balancing problem.||Source Title:||International Journal of Advanced Manufacturing Technology||URI:||http://scholarbank.nus.edu.sg/handle/10635/50757||ISSN:||02683768||DOI:||10.1007/s00170-003-1833-5|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jan 15, 2020
WEB OF SCIENCETM
checked on Jan 7, 2020
checked on Dec 30, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.