<?xml version="1.0"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/"><rdf:Description rdf:about="https://dk.um.si/IzpisGradiva.php?id=97223"><dc:title>Verification of intelligent scheduling based on deep reinforcement learning for distributed workshops via discrete event simulation</dc:title><dc:creator>Yang,	S. L.	(Avtor)
	</dc:creator><dc:creator>Wang,	J. Y.	(Avtor)
	</dc:creator><dc:creator>Xin,	L. M.	(Avtor)
	</dc:creator><dc:creator>Xu,	Z. G.	(Avtor)
	</dc:creator><dc:subject>production scheduling</dc:subject><dc:subject>distributed flowshop scheduling</dc:subject><dc:subject>discrete event simulation (DES)</dc:subject><dc:subject>deep reinforcement learning</dc:subject><dc:subject>production simulation</dc:subject><dc:subject>modelling</dc:subject><dc:subject>scheduling verification</dc:subject><dc:subject>Plant Simulation software</dc:subject><dc:description>Production scheduling, which directly influences the completion time and throughput of workshops, has received extensive research. However, due to the high cost of real-world production verification, most literature did not verify the optimized scheduling scheme in real-world workshops. This paper studied the verification of scheduling schemes and environments, using a discrete event simulation (DES) platform. The aim of this study is to provide an efficient way to verify the correctness of scheduling environments established by programming languages and scheduling results obtained by intelligent algorithms. The system architecture of scheduling verification based on DES is established. The modelling approach via DES is proposed by designing parametric workshop generation, flexible production control, and real-time data processing. The popular distributed permutation flowshop scheduling problem is selected as a case study, where the optimal scheduling scheme obtained by a deep reinforcement learning algorithm is fed into the production simulation model in Plant Simulation software. The experiment results show that the proposed scheduling verification approach can validate the scheduling scheme and environment effectively. The utilization and Gantt charts clearly show the performance of scheduling schemes. This work can help to verify the scheduling schemes and programmed scheduling environment efficiently without costly real-world validation.</dc:description><dc:publisher>Chair of Production Engineering (CPE), University of Maribor Faculty of Mechanical Engineering</dc:publisher><dc:date>2022</dc:date><dc:date>2026-02-24 10:23:42</dc:date><dc:type>Članek v reviji</dc:type><dc:identifier>97223</dc:identifier><dc:language>sl</dc:language><dc:rights>Content from this work may be used under the terms of the Creative Commons Attribution 4.0 International Licence (CC BY 4.0). Any further distribution of this work must maintain attribution to the author(s) and the title of the work, journal citation and DOI.</dc:rights></rdf:Description></rdf:RDF>
