Large production line optimization using simulated annealing

D. Spinellis, C. Papadopoulos, J. Mac Gregor Smith

Research output: Contribution to journalArticlepeer-review

64 Citations (Scopus)

Abstract

We present a robust generalized queuing 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.

Original languageEnglish
Pages (from-to)509-541
Number of pages33
JournalInternational Journal of Production Research
Volume38
Issue number3
DOIs
Publication statusPublished - Jan 15 2000

ASJC Scopus subject areas

  • Strategy and Management
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering

Fingerprint Dive into the research topics of 'Large production line optimization using simulated annealing'. Together they form a unique fingerprint.

Cite this