With the emergence of the smart factory concept, Automated Guided Vehicles have been widely utilized in job shop transportation systems, drawing increased attention to the job shop scheduling problem integrated with multiple AGVs. In this problem, the sequential-logic constraint between transportation and processing tasks in each operation complicates the problem's decoupling compared to traditional job shop scheduling problems. In this paper, a deep reinforcement learning-based method is proposed to address this integrated scheduling problem. The problem is initially formulated as a Markov Decision Process, with state features designed from the perspectives of jobs and AGVs. Furthermore, a novel reward function is designed to maximize job shop resource utilization. The primary objective of the scheduling is to obtain an optimal solution that maximizes resource utilization, thereby enhancing the core competitiveness of the factory. Benchmark experiments demonstrate the effectiveness and competitiveness of this method in obtaining solutions for the integrated problems.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.