Adaptive hybrid priority-enabled deep Q-network for machine degradation-based dynamic scheduling of assembly line

• Dynamic balancing and scheduling considering machine performance degradation. • Developed an intelligent decision-making multi-layer framework. • Proposed a novel adaptive hybrid priority deep Q-network (AHP-DQN) algorithm. • Multi-agent system is introduced to make localized dynamic decisions. • Performance of AHP-DQN is validated against existing state-of-the-art approaches. As production systems evolve, the performance degradation of machines can result in increased downtime and lower throughput; preventive maintenance is needed to fully or partially restore the initial performance of machines, making dynamic scheduling essential. This problem is modeled in this study as a Markov decision process, where each machine agent assigns components and their placement sequences based on the dynamic production status of the assembly line. This approach enables intelligent adaptation to changing machine conditions, enhances efficiency, and minimizes delays. An intelligent decision-making framework has been developed to handle agile planning and the scheduling of dynamic problems of an assembly line. This multi-layer framework is integrated with a virtual simulation model of the existing physical production system, enabling informed decision-making. An adaptive hybrid priority deep Q-network (AHP-DQN) algorithm is proposed, utilizing a distributed multi-agent system for decentralized decision-making among machines on the assembly line. To enhance the performance of the proposed AHP-DQN algorithm in environments characterized by complex state representations and uncertain machine performance degradation, two key components are customized: the neural network and experience replay buffer mechanism. First, a partially connected neural network incorporating noisy layers is employed to enhance exploration efficiency and robustness. Second, an adaptive hybrid prioritized experience replay buffer is introduced by combining line balancing with the rate to balance sampling quality and efficiency. The deep Q-network, enhanced with neural networks and experience priority mechanisms, enables the system to learn optimal balancing policies through interaction with its environment. Simulation results demonstrate that the adaptive hybrid model outperforms traditional balancing algorithms in terms of throughput and overall system performance. After investigating the performance of the AHP-DQN, it is validated that the proposed algorithm outperforms the existing approaches. Specifically, compared to the commonly used earliest completion time rule in industrial applications, the proposed method achieves a performance improvement of approximately 4–10%, highlighting its practical applicability and effectiveness.

Authors

Institutions

Publication Details

Journal
Journal of Industrial Information Integration
Published
2025-08-08
DOI
https://doi.org/10.1016/j.jii.2025.100927
Citations
1
Primary Topic
Assembly Line Balancing Optimization
Type
article
Field-Weighted Citation Impact
1.24
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Adaptive hybrid priority-enabled deep Q-network for machine degradation-based dynamic scheduling of assembly line

Jabir Mumtaz, Lun Xu, Ripon K. Chakrabortty, Jia Yan Du et al.
1 citations
Journal of Industrial Information Integration
Assembly Line Balancing Optimization
1.24
article

Adaptive hybrid priority-enabled deep Q-network for machine degradation-based dynamic scheduling of assembly line

Jabir Mumtaz, Lun Xu, Ripon K. Chakrabortty, Jia Yan Du, Pei Li, Yarong Chen
article en
1 citations

Abstract

• Dynamic balancing and scheduling considering machine performance degradation. • Developed an intelligent decision-making multi-layer framework. • Proposed a novel adaptive hybrid priority deep Q-network (AHP-DQN) algorithm. • Multi-agent system is introduced to make localized dynamic decisions. • Performance of AHP-DQN is validated against existing state-of-the-art approaches. As production systems evolve, the performance degradation of machines can result in increased downtime and lower throughput; preventive maintenance is needed to fully or partially restore the initial performance of machines, making dynamic scheduling essential. This problem is modeled in this study as a Markov decision process, where each machine agent assigns components and their placement sequences based on the dynamic production status of the assembly line. This approach enables intelligent adaptation to changing machine conditions, enhances efficiency, and minimizes delays. An intelligent decision-making framework has been developed to handle agile planning and the scheduling of dynamic problems of an assembly line. This multi-layer framework is integrated with a virtual simulation model of the existing physical production system, enabling informed decision-making. An adaptive hybrid priority deep Q-network (AHP-DQN) algorithm is proposed, utilizing a distributed multi-agent system for decentralized decision-making among machines on the assembly line. To enhance the performance of the proposed AHP-DQN algorithm in environments characterized by complex state representations and uncertain machine performance degradation, two key components are customized: the neural network and experience replay buffer mechanism. First, a partially connected neural network incorporating noisy layers is employed to enhance exploration efficiency and robustness. Second, an adaptive hybrid prioritized experience replay buffer is introduced by combining line balancing with the rate to balance sampling quality and efficiency. The deep Q-network, enhanced with neural networks and experience priority mechanisms, enables the system to learn optimal balancing policies through interaction with its environment. Simulation results demonstrate that the adaptive hybrid model outperforms traditional balancing algorithms in terms of throughput and overall system performance. After investigating the performance of the AHP-DQN, it is validated that the proposed algorithm outperforms the existing approaches. Specifically, compared to the commonly used earliest completion time rule in industrial applications, the proposed method achieves a performance improvement of approximately 4–10%, highlighting its practical applicability and effectiveness.

Journal of Industrial Information IntegrationVol. 47
Wenzhou University (CN), University of Canberra (AU), Zhejiang Environmental Monitoring Center (CN), University of Science and Technology Beijing (CN)
Openalex Percentile: Top 16%
Assembly Line Balancing Optimization
1.24
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.