| Data: |
2011 |
| Resum: |
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 variant 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 generate optimal solutions, respectively the best upper bounds, for 283 out of 302 test cases. Moreover, for 9 further test cases the algorithm is able to improve the currently best upper bounds. These numbers indicate that the proposed iterative beam search algorithm is currently a state-of-the-art method for the SALBP-2. |
| Drets: |
Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial i la comunicació pública de l'obra, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original. No es permet la creació d'obres derivades.  |
| Llengua: |
Anglès |
| Document: |
Article ; recerca ; Versió publicada |
| Matèria: |
Assembly line balancing ;
Fixed number of work stations ;
Beam search |
| Publicat a: |
SORT : statistics and operations research transactions, Vol. 35, Núm. 2 (July-December 2011) , p. 145-164, ISSN 2013-8830 |
visitant ::
identificació
