TY - JOUR
T1 - Game Theory Based Real-Time Shop Floor Scheduling Strategy and Method for Cloud Manufacturing
AU - Zhang, Yingfeng
AU - Wang, Jin
AU - Liu, Sichao
AU - Qian, Cheng
N1 - Publisher Copyright:
© 2016 Wiley Periodicals, Inc.
PY - 2017/4/1
Y1 - 2017/4/1
N2 - With the rapid advancement and widespread application of information and sensor technologies in manufacturing shop floor, the typical challenges that cloud manufacturing is facing are the lack of real-time, accurate, and value-added manufacturing information, the efficient shop floor scheduling strategy, and the method based on the real-time data. To achieve the real-time data-driven optimization decision, a dynamic optimization model for flexible job shop scheduling based on game theory is put forward to provide a new real-time scheduling strategy and method. Contrast to the traditional scheduling strategy, each machine is an active entity that will request the processing tasks. Then, the processing tasks will be assigned to the optimal machines according to their real-time status by using game theory. The key technologies such as game theory mathematical model construction, Nash equilibrium solution, and optimization strategy for process tasks are designed and developed to implement the dynamic optimization model. A case study is presented to demonstrate the efficiency of the proposed strategy and method, and real-time scheduling for four kinds of exceptions is also discussed.
AB - With the rapid advancement and widespread application of information and sensor technologies in manufacturing shop floor, the typical challenges that cloud manufacturing is facing are the lack of real-time, accurate, and value-added manufacturing information, the efficient shop floor scheduling strategy, and the method based on the real-time data. To achieve the real-time data-driven optimization decision, a dynamic optimization model for flexible job shop scheduling based on game theory is put forward to provide a new real-time scheduling strategy and method. Contrast to the traditional scheduling strategy, each machine is an active entity that will request the processing tasks. Then, the processing tasks will be assigned to the optimal machines according to their real-time status by using game theory. The key technologies such as game theory mathematical model construction, Nash equilibrium solution, and optimization strategy for process tasks are designed and developed to implement the dynamic optimization model. A case study is presented to demonstrate the efficiency of the proposed strategy and method, and real-time scheduling for four kinds of exceptions is also discussed.
UR - http://www.scopus.com/inward/record.url?scp=84995610393&partnerID=8YFLogxK
U2 - 10.1002/int.21868
DO - 10.1002/int.21868
M3 - 文章
AN - SCOPUS:84995610393
SN - 0884-8173
VL - 32
SP - 437
EP - 463
JO - International Journal of Intelligent Systems
JF - International Journal of Intelligent Systems
IS - 4
ER -