2390 KB0 KB201420262022Wang, J. Y.Xin, L. M.Xu, Z. G.Yang, S. L.letnik:17številka:4str. 401-412DOI:10.14743/apem2022.4.444ISSN:1854-6250COBISSID_HOST:269429763URN:URN:NBN:SI:doc-J4C2JP90enFakulteta za strojništvo, Inštitut za proizvodno strojništvoAdvances in production engineering and managementalgoritmideep reinforcement learningdiscrete event simulation (DES)distributed flowshop schedulinggloboko okrepljeno učenjemodeliranjemodellingPlant Simulation softwareproces razporejanjaproduction schedulingproduction simulationproizvodnjascheduling verificationsimulacija proizvodnjeVerification of intelligent scheduling based on deep reinforcement learning for distributed workshops via discrete event simulation|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 validationTEXTznanstveno časopisjejournalsSlovenian National E-content AggregatorNational and University Library of SloveniaUniverza v Mariboru, Fakulteta za strojništvo