dc.creator | Pandelis, D. G. | en |
dc.creator | Van Oyen, M. P. | en |
dc.date.accessioned | 2015-11-23T10:42:18Z | |
dc.date.available | 2015-11-23T10:42:18Z | |
dc.date.issued | 2012 | |
dc.identifier.issn | 0021-9002 | |
dc.identifier.uri | http://hdl.handle.net/11615/31574 | |
dc.description.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. | en |
dc.source | Journal of Applied Probability | en |
dc.source.uri | <Go to ISI>://WOS:000306025200019 | |
dc.subject | Stochastic scheduling | en |
dc.subject | worker flexibility | en |
dc.subject | throughput maximization | en |
dc.subject | serial production line | en |
dc.subject | SERVER ASSIGNMENT POLICIES | en |
dc.subject | THROUGHPUT MAXIMIZATION | en |
dc.subject | TANDEM LINES | en |
dc.subject | PERFORMANCE | en |
dc.subject | SYSTEMS | en |
dc.subject | Statistics & Probability | en |
dc.title | SAMPLE PATH OPTIMAL POLICIES FOR SERIAL LINES WITH FLEXIBLE WORKERS | en |
dc.type | journalArticle | en |