Balancing assembly lines effectively – a computational comparison

Balancing assembly lines effectively – a computational comparison

0.00 Avg rating0 Votes
Article ID: iaor20001515
Country: Netherlands
Volume: 114
Issue: 3
Start Page Number: 50
End Page Number: 58
Publication Date: Apr 1999
Journal: European Journal of Operational Research
Authors: ,
Keywords: production, programming: branch and bound
Abstract:

We report on results of a numerical experiment including the most effective branch and bound procedures for solving type 1 of the simple assembly line balancing problem (SALBP-1), namely Johnson's FABLE, Nourie and Venta's OptPack, Hoffmann's Eureka and School and Klein's SALOME. It appears that SALOME clearly outperforms the other procedures with respect to hard instances of a new challenging data set. Beyond that, it is shown that the performance of SALOME can greatly be improved by adding some further features including dynamic renumbering and dominance rules.

Reviews

Required fields are marked *. Your email address will not be published.