June 2012 Sample path optimal policies for serial lines with flexible workers
Dimitrios G. Pandelis, Mark P. Van Oyen
Author Affiliations +
J. Appl. Probab. 49(2): 582-589 (June 2012). DOI: 10.1239/jap/1339878806

Abstract

We study the dynamic assignment of cross-trained workers in serial production lines characterized by stochastic process times and inventory buffers between stations. Throughput maximization is the objective. Each worker is trained for a subset of tasks, where emphasis is placed on systems with each worker trained for a zone of stations with stations near the zone boundaries being served (shared) by one or more other workers as well. Using sample path comparisons, we identify structural properties of optimal worker allocation policies. We identify when (i) a worker can prioritize the job in the most downstream station (last-buffer-first-served), and (ii) only the downstream (as opposed to upstream) server should serve a single task.

Citation

Download Citation

Dimitrios G. Pandelis. Mark P. Van Oyen. "Sample path optimal policies for serial lines with flexible workers." J. Appl. Probab. 49 (2) 582 - 589, June 2012. https://doi.org/10.1239/jap/1339878806

Information

Published: June 2012
First available in Project Euclid: 16 June 2012

zbMATH: 1242.90084
MathSciNet: MR2977815
Digital Object Identifier: 10.1239/jap/1339878806

Subjects:
Primary: 90B36
Secondary: 60G17 , 90B22

Keywords: serial production line , stochastic scheduling , throughput maximization , worker flexibility

Rights: Copyright © 2012 Applied Probability Trust

JOURNAL ARTICLE
8 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

Vol.49 • No. 2 • June 2012
Back to Top