TY - JOUR
T1 - Competitive scheduling in a hybrid flow shop problem using multi-leader–multi-follower game - A case study from Iran
AU - Safari, Ghasem
AU - Hafezalkotob, Ashkan
AU - Malekpour, Hiva
AU - Khalilzadeh, Mohammad
N1 - Publisher Copyright:
© 2022 Elsevier Ltd
PY - 2022/6/1
Y1 - 2022/6/1
N2 - It is logical that organizations pay more attention to their major customers which have more impacts on their abilities or benefits. In many real cases, decision makers in scheduling system must prioritize the sequence of processing orders according to the agent of orders while the classic production scheduling do not have the ability to consider the relationships between agents. These problems can be modeled by the Stackelberg problems in the field of game theory. In this study, an agent-based hybrid flow shop problem is formulated by using the multi-leader multi-follower mathematical model. Each level is evaluated by Nash equilibrium and Nash bargaining with the new co-evolutionary and genetic algorithm. The proposed model is validated in a real case problem in the tire manufacturing industry. The results show that Nash equilibrium is superior to Nash bargaining for all agents.
AB - It is logical that organizations pay more attention to their major customers which have more impacts on their abilities or benefits. In many real cases, decision makers in scheduling system must prioritize the sequence of processing orders according to the agent of orders while the classic production scheduling do not have the ability to consider the relationships between agents. These problems can be modeled by the Stackelberg problems in the field of game theory. In this study, an agent-based hybrid flow shop problem is formulated by using the multi-leader multi-follower mathematical model. Each level is evaluated by Nash equilibrium and Nash bargaining with the new co-evolutionary and genetic algorithm. The proposed model is validated in a real case problem in the tire manufacturing industry. The results show that Nash equilibrium is superior to Nash bargaining for all agents.
KW - Hybrid genetic algorithm
KW - Leader-follower problems
KW - Nash bargaining
KW - Scheduling game
KW - Stackelberg problems
UR - http://www.scopus.com/inward/record.url?scp=85124419343&partnerID=8YFLogxK
U2 - 10.1016/j.eswa.2022.116584
DO - 10.1016/j.eswa.2022.116584
M3 - Article
AN - SCOPUS:85124419343
SN - 0957-4174
VL - 195
JO - Expert Systems with Applications
JF - Expert Systems with Applications
M1 - 116584
ER -