Competitive scheduling in a hybrid flow shop problem using multi-leader–multi-follower game - A case study from Iran

Abass, 2005, Bilevel programming approach applied to the flow shop scheduling problem under fuzziness, Computational Management Science, 2, 279, 10.1007/s10287-005-0035-z Abdollahpour, 2015, Minimizing makespan for flow shop scheduling problem with intermediate buffers by using hybrid approach of artificial immune system, Applied Soft Computing, 28, 44, 10.1016/j.asoc.2014.11.022 Akyildiz, 2015, A decision framework proposal for customer order prioritization: A case study for a structural steel company, International Journal of Production Economics, 169, 21, 10.1016/j.ijpe.2015.07.004 Aqil, 2020, Local search metaheuristic for solving hybrid flow shop problem in slabs and beams manufacturing, Expert Systems with Applications, 162, 1 Bai, 1997, Production scheduling in a price competition, Computer Math Application, 33, 5, 10.1016/S0898-1221(97)00015-1 Baniak, 2012, Innovation analysis and game theory: A review, Innovation: Management, Policy and Practice, 14, 178, 10.5172/impp.2012.14.2.178 Basir, S. A., Mazdeh, M., M., & Namakshenas, M. (2018). Bi-level genetic algorithms for a two-stage assembly flow-shop scheduling problem with batch delivery system. Computers & Industrial Engineering, 126, 217–231. 10.1016/j.cie.2018.09.035. Cai, 2021, A shuffled frog-leaping algorithm with memeplex quality for bi-objective distributed scheduling in hybrid flow shop, International Journal of Production Research, 59, 5404, 10.1080/00207543.2020.1780333 Chen, 2021, Real-time order acceptance and scheduling for data-enabled permutation flow shops: Bilevel interactive optimization with nonlinear integer programming, Omega, 105, 102499, 10.1016/j.omega.2021.102499 Chen, 2017, Optimal decisions in a retailer Stackelberg supply chain, International Journal of Production Economics, 187, 260, 10.1016/j.ijpe.2017.03.002 Cho, 2017, A two-level method of production planning and scheduling for bi-objective reentrant hybrid flow shops, Computers & Industrial Engineering, 106, 174, 10.1016/j.cie.2017.02.010 Chuaa, 2018, A Stackelberg game in multi-period planning of make-to-order production system across the supply chain, Journal of Manufacturing Systems, 46, 231, 10.1016/j.jmsy.2018.01.004 Dai, 2017, Real-time pricing scheme based on Stackelberg game in smart grid with multiple power retailers, Neurocomputing, 260, 149, 10.1016/j.neucom.2017.04.027 Guo, 2016, A bi-level evolutionary optimization approach for integrated production and transportation scheduling, Applied Soft Computing, 42, 215, 10.1016/j.asoc.2016.01.052 Gupta, 2018, Can lean lead to green? Assessment of radial tyre manufacturing processes using system dynamics modelling, Computers & Operations Research, 89, 284, 10.1016/j.cor.2017.03.015 Han, Z., Zhu, J., & Ray Liu, K. J. (2004, 29 November -3 December). Low-Complexity OFDMA Channel Allocation with Nash Bargaining Solution Fairness. IEEE Global Telecommunications Conference, 3726–3731. Dallas, TX, USA. 10.1109/GLOCOM.2004.1379065. Han. Z., Zhu, Y., Ma, Xiaofu, & Chen., Z. (2016). Multiple rules with game theoretic analysis for flexible flow shop scheduling problem with component altering times. International Journal of Modelling, Identification and Control, 26 (1), 1–19. Hejazi, 2002, Linear bilevel programming solution by genetic algorithm, Computers & Operations Research, 29, 1913, 10.1016/S0305-0548(01)00066-1 Homburg, 2008, Customer prioritization: Does it pay off, and how should it be implemented?, Journal of Marketing, 72, 110, 10.1509/jmkg.72.5.110 Jou, 2014, Integrating the Taguchi Method and Response Surface Methodology for Process Parameter Optimization of the Injection Molding, Applied Mathematics & Information Sciences, 8, 1277, 10.12785/amis/080342 Kasemset, 2012, A PSO-based procedure for a bi-level multi-objective TOC-based job-shop scheduling problem, International Journal of Operational Research, 14, 50, 10.1504/IJOR.2012.046343 Kim, 2019, Optimal Operational Scheduling of Distribution Network with Microgrid via Bi-Level Optimization Model with Energy Band, Applied Science, 9, 1, 10.3390/app9204219 Kim, 2011, Adaptive Online Voltage Scaling Scheme Based on the Nash Bargaining Solution, ETRI Journal, 33, 407, 10.4218/etrij.11.0110.0417 Kundak, 2016, Hybrid genetic algorithms for minimizing makespan in dynamic job shop scheduling problem, Computers & Industrial Engineering, 96, 31, 10.1016/j.cie.2016.03.011 Lei, 2011, Simplified multi-objective genetic algorithms for stochastic job shop scheduling, Applied Soft Computing, 11, 4991, 10.1016/j.asoc.2011.06.001 Lei, D., & Guo, X. (2015). A shuffled frog-leaping algorithm for hybrid flow shop scheduling with two agents. Expert Systems with Applications, 42 (23), 9333–9339. 10.1016/j.eswa.2015.08.025. Li, 2016, An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem, International Journal of Production Economics, 174, 93, 10.1016/j.ijpe.2016.01.016 Li, 2021, Bi-objective hybrid flow shop scheduling with common due date, Operational Research, 21, 1153, 10.1007/s12351-019-00470-8 Malekpour, 2021, Product Processing Prioritization in Hybrid Flow Shop Systems Supported on Nash Bargaining Model and Simulation-Optimization, Expert System with Application, 180, 115066, 10.1016/j.eswa.2021.115066 Naderi, 2014, Hybrid flexible flow shop problems: Models and solution methods, Applied Mathematical Modelling, 38, 5767, 10.1016/j.apm.2014.04.012 Nalbant, 2007, Application of Taguchi method in the optimization of cutting parameters for surface roughness in turning, Materials and Design, 28, 1379, 10.1016/j.matdes.2006.01.008 Pang, 2005, Quasi-variational inequalities, generalized Nash equilibria, and multi-leader-follower games, Computational Management Science, 2, 21, 10.1007/s10287-004-0010-0 Pei, 2019, A hybrid BA-VNS algorithm for coordinated serial-batching scheduling with deteriorating jobs, financial budget, and resource constraint in multiple manufacturers, Omega, 82, 55, 10.1016/j.omega.2017.12.003 Razali, 2011 Ren, 2021, A new solution to distributed permutation flow shop scheduling problem based on NASH Q-Learning, Advances in Production Engineering & Management, 16, 269, 10.14743/apem2021.3.399 Rolf, 2020, Assigning dispatching rules using a genetic algorithm to solve a hybrid flow shop scheduling problem, Procedia Manufacturing, 42, 442, 10.1016/j.promfg.2020.02.051 Ruiz, 2010, The hybrid flow shop scheduling problem, European Journal of Operational Research., 205, 1, 10.1016/j.ejor.2009.09.024 Safari, 2018, A Nash bargaining model for flow shop scheduling problem under uncertainty: A case study from tire manufacturing in Iran, The International Journal of Advanced Manufacturing Technology, 96, 531, 10.1007/s00170-017-1461-0 Sinha, 2014, Finding optimal strategies in a multi-period multi-leader–follower Stackelberg game using an evolutionary algorithm, Computers & Operations Research, 14, 374, 10.1016/j.cor.2013.07.010 Shao, 2020, Hybrid enhanced discrete fruit fly optimization algorithm for scheduling blocking flow-shop in distributed environment, Expert Systems with Applications, 145, 113147, 10.1016/j.eswa.2019.113147 Sun, 2014, Scheduling flexible job shop problem subject to machine breakdown with game theory, International Journal of Production Research, 52, 3858, 10.1080/00207543.2013.784408 Talbi, E. G. (2009). Metaheuristics: from design to implementation. John Wiley & Sons, Hoboken, New Jersey, 74, 126-13. Benbouzid-Si Tayeb, 2018, Game theory-based integration of scheduling with flexible and periodic maintenance planning in the permutation flowshop sequencing problem, Operational Research, 18, 221, 10.1007/s12351-016-0261-x Tesoriere, 2017, Stackelberg equilibrium with many leaders and followers. The case of zero fixed costs, Research in Economics, 71, 102, 10.1016/j.rie.2016.11.004 Touati, 2006, Generalized Nash Bargaining Solution for bandwidth allocation, Computer Networks, 50, 3242, 10.1016/j.comnet.2005.12.006 Wang, 2021, Evolutionary game based real-time scheduling for energy-efficient distributed and flexible job shop, Journal of Cleaner Production, 293, 126093, 10.1016/j.jclepro.2021.126093 Wang, 2019, Multiagent and bargaining-game-based real-time scheduling for internet of things-enabled flexible job shop, IEEE Internet of Things Journal, 6, 2518, 10.1109/JIOT.2018.2871346 Wang, 2014, Supplier evaluation based on Nash bargaining game model, Expert Systems with Applications, 14, 4181, 10.1016/j.eswa.2013.12.044 Xhafa, 2008, Metaheuristics for Scheduling in Industrial and Manufacturing Applications, Springer-Verlag, Berlin Heidelberg, 128, 8 Yankai, W., Shilong, W., Dong, L., Cheunfeng, S, & Bo., Y. (2021). An improved multi-objective whale optimization algorithm for the hybrid flow shop scheduling problem considering device dynamic. Expert Systems With Applications, 174, Article 114793. 10.1016/j.eswa.2021.114793. Yue, 2014, Game-theoretic modeling and optimization of multi-echelon supply chain design and operation under Stackelberg game and market equilibrium, Computers & Chemical Engineering, 71, 347, 10.1016/j.compchemeng.2014.08.010 Zhang, 2014, Bilevel direct search method for leader–follower problems and application in health insurance, Computers & Operations Research, 41, 359, 10.1016/j.cor.2012.12.005 Zhang, 2020, Joint production planning, pricing and retailer selection with emission control based on Stackelberg game and nested genetic algorithm, Expert Systems with Applications, 161, 113733, 10.1016/j.eswa.2020.113733 Zhang, 2017, Game theory based real-time multi-objective flexible job shop scheduling considering environmental impact, Journal of Cleaner Production, 167, 665 Zhao, 2020, A hybrid discrete water wave optimization algorithm for the no-idle flow shop scheduling problem with total tardiness criterion, Expert Systems with Applications, 146, 113166, 10.1016/j.eswa.2019.113166 Zhao, 2020, An ensemble discrete differential evolution for the distributed blocking flowshop scheduling with minimizing makespan criterion, Expert Systems with Applications, 160, 113678, 10.1016/j.eswa.2020.113678 Zhou, 2021, A Self-Adaptive Differential Evolution Algorithm for Scheduling a Single Batch-Processing Machine with Arbitrary Job Sizes and Release Times, IEEE Transactions on Cybernetics, 51, 1430, 10.1109/TCYB.2019.2939219