Iterative Beam Search for Simple Assembly Line Balancing with a Fixed Number of Work Stations

Details Iterative Beam Search for Simple Assembly Line Balancing with a Fixed Number of Work Stations Iterative Beam Search for Simple Assembly Line Balancing with a Fixed Number of Work Stations

2010-12-15

arxiv.org/abs/1012.3273v1

Computer Science

Discrete Mathematics

Scientific paper

The simple assembly line balancing problem (SALBP) concerns the assignment of tasks with pre-defined processing times to work stations that are arranged in a line. Hereby, precedence constraints between the tasks must be respected. The optimization goal of the SALBP-2 version of the problem concerns the minimization of the so-called cycle time, that is, the time in which the tasks of each work station must be completed. In this work we propose to tackle this problem with an iterative search method based on beam search. The proposed algorithm is able to obtain optimal, respectively best-known, solutions in 283 out of 302 test cases. Moreover, for 9 further test cases the algorithm is able to produce new best-known solutions. These numbers indicate that the proposed iterative beam search algorithm is currently a state-of-the-art method for the SALBP-2.

Affiliated with

Also associated with

No associations

Rating

Iterative Beam Search for Simple Assembly Line Balancing with a Fixed Number of Work Stations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Iterative Beam Search for Simple Assembly Line Balancing with a Fixed Number of Work Stations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Iterative Beam Search for Simple Assembly Line Balancing with a Fixed Number of Work Stations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-13649