Large production line optimization using simulated annealing

Large production line optimization using simulated annealing

0.00 Avg rating0 Votes
Article ID: iaor20002705
Country: United Kingdom
Volume: 38
Issue: 3
Start Page Number: 509
End Page Number: 541
Publication Date: Jan 2000
Journal: International Journal of Production Research
Authors: , ,
Keywords: optimization: simulated annealing
Abstract:

We present a robust generalized queueing network algorithm as an evaluative procedure for optimizing production line configurations using simulated annealing. We compare the results obtained with our algorithm to those of other studies and find some interesting similarities but also striking differences between them in the allocation of buffers, numbers of servers, and their service rates. While context dependent, these patterns of allocation are one of the most important insights which emerge in solving very long production lines. The patterns, however, are often counter-intuitive, which underscores the difficulty of the problem we address. The most interesting feature of our optimization procedure is its bounded execution time, which makes it viable for optimizing very long production line configurations. Based on the bounded execution time property, we have optimized configurations of up to 60 stations with 120 buffers and servers in less than five hours of CPU time.

Reviews

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