TY - GEN
T1 - Transient Modeling and Scheduling for Heterogeneous Serial Lines with Bernoulli Machines and Finite Buffers
AU - Shi, Jiawei
AU - Jia, Zhiyang
AU - Zuo, Guanzhong
AU - Wang, Gang
AU - Qi, Yongsheng
N1 - Publisher Copyright:
© 2023 IEEE.
PY - 2023
Y1 - 2023
N2 - In recent years, with the increasing emphasis on intelligent manufacturing at the national level, the influence of flexible manufacturing systems and distributed production in the manufacturing industry has been expanding. Meanwhile, serial lines with limited buffers and random machine failures have been commonly seen in practical flexible production. When orders from the same customer are produced in different lines, the required production processes and cycles may differ. In such cases, these serial lines can be referred to as heterogeneous lines. This paper offers a model and analysis of a mixed-series assembly line featuring Bernoulli machines and finite buffer storage, followed by a discussion on the optimal scheduling problem for job allocation. A novel strategy is introduced for addressing the scheduling problem, utilizing a discrete particle swarm optimization algorithm. The effectiveness of the algorithm is demonstrated through numerical experiments.
AB - In recent years, with the increasing emphasis on intelligent manufacturing at the national level, the influence of flexible manufacturing systems and distributed production in the manufacturing industry has been expanding. Meanwhile, serial lines with limited buffers and random machine failures have been commonly seen in practical flexible production. When orders from the same customer are produced in different lines, the required production processes and cycles may differ. In such cases, these serial lines can be referred to as heterogeneous lines. This paper offers a model and analysis of a mixed-series assembly line featuring Bernoulli machines and finite buffer storage, followed by a discussion on the optimal scheduling problem for job allocation. A novel strategy is introduced for addressing the scheduling problem, utilizing a discrete particle swarm optimization algorithm. The effectiveness of the algorithm is demonstrated through numerical experiments.
KW - Bernoulli machine
KW - discrete particle swarm optimization
KW - heterogeneous line
KW - serial line
UR - http://www.scopus.com/inward/record.url?scp=85189371571&partnerID=8YFLogxK
U2 - 10.1109/CAC59555.2023.10451165
DO - 10.1109/CAC59555.2023.10451165
M3 - Conference contribution
AN - SCOPUS:85189371571
T3 - Proceedings - 2023 China Automation Congress, CAC 2023
SP - 1319
EP - 1324
BT - Proceedings - 2023 China Automation Congress, CAC 2023
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2023 China Automation Congress, CAC 2023
Y2 - 17 November 2023 through 19 November 2023
ER -