Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-14T10:29:38.138Z Has data issue: false hasContentIssue false

Sample Path Optimal Policies for Serial Lines with Flexible Workers

Published online by Cambridge University Press:  04 February 2016

Dimitrios G. Pandelis*
Affiliation:
University of Thessaly
Mark P. Van Oyen*
Affiliation:
University of Michigan
*
∗ Postal address: Department of Mechanical Engineering, University of Thessaly, Pedion Areos, 38334 Volos, Greece. Email address: d_pandelis@mie.uth.gr
∗∗ Postal address: Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, MI 48109-2117, USA.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Article
Copyright
© Applied Probability Trust