Intelligent Decision-Making of Scheduling for Dynamic Permutation Flowshop via Deep Reinforcement Learning
Dynamic scheduling problems have been receiving increasing attention in recent years due to their practical implications. To realize real-time and the intelligent decision-making of dynamic scheduling, we studied dynamic permutation flowshop scheduling problem (PFSP) with new job arrival using deep...
Main Authors: | Shengluo Yang, Zhigang Xu, Junyi Wang |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2021-02-01
|
Series: | Sensors |
Subjects: | |
Online Access: | https://www.mdpi.com/1424-8220/21/3/1019 |
Similar Items
-
A non-permutation flowshop scheduling problem with lot streaming: A Mathematical model
by: Daniel Rossit, et al.
Published: (2016-06-01) -
A Genetic Algorithm to Minimize the Total Tardiness for M-Machine Permutation Flowshop Problems
by: Chia-Shin Chung, et al.
Published: (2012-01-01) -
An Application On Flowshop Scheduling
by: Sündüz Dağ
Published: (2013-12-01) -
Branch and bound algorithm for solving the total weighted tardiness criterion for the permutation flowshop scheduling problem with time lags
by: Almathkour Fatmah, et al.
Published: (2022-01-01) -
A Hybrid Bat Algorithm for Solving the Three-Stage Distributed Assembly Permutation Flowshop Scheduling Problem
by: Jianguo Zheng, et al.
Published: (2021-10-01)