Publication Type
Journal Article
Version
submittedVersion
Publication Date
1-2022
Abstract
Bucket brigades are notably used to coordinate workers in production systems. We study a J-station, I-worker bucket brigade system. The time duration for each worker to serve a job at a station is exponentially distributed with a rate that depends on the station's expected work content and the worker's work speed. Our goal is to maximize the system's productivity or to minimize its inter-completion time variability. We analytically derive the throughput and the coefficient of variation (CV) of the inter-completion time. We study the system under two cases. (i) If the work speeds depend only on the workers, the throughput gap between the stochastic and the deterministic systems can be up to 47% when the number of stations is small. Either maximizing the throughput or minimizing the CV of the inter-completion time, the slowest-to-fastest worker sequence always outperforms the reverse sequence for the stochastic bucket brigade. To maximize the throughput, more work content should be assigned to the stations near the faster workers. In contrast, tominimize the CV of the inter-completion time, more work content should be allocated to the stations near the slower workers. (ii) If the work speeds depend on the workers and the stations such that the workers may not dominate each other at every station, the asymptotic throughput can be expressed as a function of the average work speeds and the asymptotic expected blocked times of the workers, and can be interpreted as the sum of the effective production rates of all the workers.
Keywords
Bucket brigade, Stochastic service time, Productivity, Variability
Discipline
Operations and Supply Chain Management | Operations Research, Systems Engineering and Industrial Engineering
Research Areas
Operations Management
Publication
Production and Operations Management
Volume
31
Issue
1
First Page
358
Last Page
373
ISSN
1059-1478
Identifier
10.1111/poms.13539
Publisher
Wiley
Citation
WANG, Peng; PAN, Kai; YAN, Zhenzhen; and LIM, Yun Fong.
Managing stochastic bucket brigades on discrete work stations. (2022). Production and Operations Management. 31, (1), 358-373.
Available at: https://ink.library.smu.edu.sg/lkcsb_research/6911
Copyright Owner and License
Authors
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
External URL
http://www.mysmu.edu/faculty/yflim/
Additional URL
https://doi.org/10.1111/poms.13539
Included in
Operations and Supply Chain Management Commons, Operations Research, Systems Engineering and Industrial Engineering Commons