Abstract
Jobshop scheduling is a classic instance in the field of production scheduling. Solving and optimizing the scheduling problem of the jobshop can greatly reduce the production cost of the workshop and improve the processing efficiency, thereby improving the market competitiveness of the manufacturing enterprises. In order to make decisions on the complex dynamic scheduling process more accurately and simplify the solution process, the jobshop scheduling problem can be transformed into a reinforcement learning problem based on the Markov decision process. The performance of the adaptive scheduling algorithm in a dynamic manufacturing environment is improved based on the Deep Q Network (DQN). In the proposed scheduling algorithm, five state features of continuous value ranges are designed for input to a Deep Neural Network (DNN), as well as ten well-known heuristic dispatching rules are selected as the action set of the DQN. In the proposed scheduling algorithm, the target network and the prediction network are used to train the parameters. An action selection strategy based on the “softmax” function is designed in DQN. It selects dispatching rules with the largest action value as the execution action, thereby solving the problem that the suboptimal action value is greater than the optimal action Q value in the early learning stage. Furthermore, the non-optimal action is selected with a greater probability in the later learning stage. Ten benchmark jobshop test instances called “LA” used as simulation objects and operated in a simulation environment composed of Python. The simulation results confirm that the proposed scheduling algorithm based on DQN has better performance and universality than a single dispatching rule or traditional Q learning algorithm.
Highlights
The jobshop scheduling problem (JSP) is a comprehensive expression and simplified model for modern manufacturing environments such as assembly shops, chip and semiconductor process manufacturing plants, and mechanical parts processing plants
Many algorithms based on classical mathematical programming and various heuristic methods have been put forward to solve the JSP, where the jobshop is modeled as a static manufacturing environment with known production and processing attributes
In a dynamic environment such as “the job arrives at the workshop randomly”, the above scheduling algorithm for solving dynamic jobshop scheduling problem (DJSP) can quickly and accurately select the best dispatching rule (DR) for each scheduling time to guide the processing tasks in the actual production situation that changes from time to time
Summary
The jobshop scheduling problem (JSP) is a comprehensive expression and simplified model for modern manufacturing environments such as assembly shops, chip and semiconductor process manufacturing plants, and mechanical parts processing plants. In a dynamic environment such as “the job arrives at the workshop randomly”, the above scheduling algorithm for solving DJSP can quickly and accurately select the best DRs for each scheduling time to guide the processing tasks in the actual production situation that changes from time to time. This algorithm can make the entire scheduling system run stably in a dynamic environment and achieve the desired performance indicators.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.