Workload minimization in re-entrant lines

This paper is concerned with workload minimization in re-entrant lines with exponential service times and preemptive control policies. Using a numerical algorithm called the power series algorithm we obtain nearly optimal policies for systems with up to 8 queues. We also improve considerably the implementation of the power series algorithm. Key words: Dynamic programming, re-entrant lines, power series algorithm, curse of dimensionality.

• Type: Journal
• Year: 2006
• Where: EOR
• Authors: Ger Koole, Auke Pot
• Keywords: Algorithm, EOR 2006, Power Series, Re-entrant Lines