Maximizing the throughput of a rotating Seru with nonpreemptive discrete stations

被引:4
作者
Gai, Yin [1 ]
Yin, Yong [2 ,5 ]
Li, Dongni [3 ]
Zhang, Yaoxin [3 ]
Tang, Jiafu [4 ]
机构
[1] Dongbei Univ Finance & Econ, Coll Data Sci & Artificial Intelligence, Dalian, Peoples R China
[2] Doshisha Univ, Grad Sch Business, Kyoto, Japan
[3] Beijing Inst Technol, Sch Comp Sci, Beijing, Peoples R China
[4] Dongbei Univ Finance & Econ, Coll Management Sci & Engn, Dalian, Peoples R China
[5] Doshisha Univ, Grad Sch Business, Kamigyo Ku, Kyoto 6028580, Japan
关键词
bucket brigade; order picking; production systems; work coordination; CELLULAR BUCKET BRIGADES; PRODUCTION LINE;
D O I
10.1002/nav.22140
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
Seru production systems are an effective way to respond to ever-changing market demand. This article focuses on maximizing the throughput of rotating serus with nonpreemptive stations, where a worker's operations cannot be disrupted. We analyze the effects of unbalanced worker velocities on non-value-added idle times. Through the use of dynamical system theories, we explicate the mechanism and dynamics of rotating serus, and identify the rules used to coordinate workers and distribute work content among stations to achieve the highest throughput. These findings provide practical guidelines for managers in floor shops for optimizing rotating seru design and maximizing throughput. Additionally, we explore the chaotic characteristics of rotating serus and simulate the effect of various factors on throughput. Finally, our comparative analysis demonstrates that the rotating seru offers a viable alternative to existing production systems to adapt to fluctuating demand.
引用
收藏
页码:910 / 928
页数:19
相关论文
共 47 条
[41]   Lessons from seru production on manufacturing competitively in a high cost environment [J].
Yin, Yong ;
Stecke, Kathryn E. ;
Swink, Morgan ;
Kaku, Ikou .
JOURNAL OF OPERATIONS MANAGEMENT, 2017, 49-51 :67-76
[42]   Configuring a seru production system to match supply with volatile demand [J].
Zhan, Rongxin ;
Li, Dongni ;
Ma, Tao ;
Cui, Zihua ;
Du, Shaofeng ;
Yin, Yong .
APPLIED INTELLIGENCE, 2023, 53 (10) :12925-12936
[43]  
Zhang Z., 2021, Asian Journal of Management Science and Applications, V6, P17
[44]  
Zhang Z., 2022, INT J PROD RES, V61, P1
[45]   An exact quadratic programming approach based on convex reformulation for seru scheduling problems [J].
Zhang, Zhe ;
Song, Xiaoling ;
Gong, Xue ;
Yin, Yong ;
Lev, Benjamin ;
Zhou, Xiaoyang .
NAVAL RESEARCH LOGISTICS, 2022, 69 (08) :1096-1107
[46]   Logic-based Benders decomposition method for the seru scheduling problem with sequence-dependent setup time and DeJong's learning effect [J].
Zhang, Zhe ;
Song, Xiaoling ;
Huang, Huijung ;
Zhou, Xiaoyang ;
Yin, Yong .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2022, 297 (03) :866-877
[47]   Improved genetic-simulated annealing algorithm for seru loading problem with downward substitution under stochastic environment [J].
Zhang, Zhe ;
Wang, Lili ;
Song, Xiaoling ;
Huang, Huijun ;
Yin, Yong .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2022, 73 (08) :1800-1811