Abstract
In this paper, a simple two-agent multi-objective scheduling system for flexible job-shop scheduling problem is proposed and corresponding framework is given. Under the framework, a broadcast communication mechanism with task mark and leader–follower control mode are designed and used to ensure orderly activities among agents. To obtain initial solution and improve it, competition and cooperation strategies are developed. To jump out of the local optimal solution and expend the search space, an adaptive iterative loop solving mechanism is designed. Three commonly used benchmark instance sets are adopted to test the performance of the proposed method. Computation results and comparison analysis with other excellent algorithms demonstrate that it is feasible and effective.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Availability of data and material
Not applicable.
Code availability
Not applicable.
References
Amjad MK, Butt SI, Kousar R et al (2018) Recent research trends in genetic algorithm based flexible job shop scheduling problems. Math Probl, Eng
Andrade-Pineda JL, Canca D, Gonzalez-R PL, Calle M (2020) Scheduling a dual-resource flexible job shop with makespan and due date-related criteria. Ann Oper Res 291:5–35. https://doi.org/10.1007/s10479-019-03196-0
Asadzadeh L (2015) A local search genetic algorithm for the job shop scheduling problem with intelligent agents. Comput Ind Eng. https://doi.org/10.1016/j.cie.2015.04.006
Bagheri A, Zandieh M, Mahdavi I, Yazdani M (2010) An artificial immune algorithm for the flexible job-shop scheduling problem. Future Gener Comput Syst. https://doi.org/10.1016/j.future.2009.10.004
Barnes JW, Chambers JB (1996) Flexible job shop scheduling by tabu search. Graduate Program in Operations Research and Industrial Engineering. University of Texas, Austin, Technical Report Series, ORP96-09.
Brandimarte P (1993) Routing and scheduling in a flexible job shop by tabu search. Ann Oper Res 41:157–183. https://doi.org/10.1007/BF02023073
Brucker P, Schlie R (1990) Job-shop scheduling with multi-purpose machines. Computing 45:369–375. https://doi.org/10.1007/BF02238804
Chen R, Yang B, Li S, Wang S (2020) A self-learning genetic algorithm based on reinforcement learning for flexible job-shop scheduling problem. Comput Ind Eng. https://doi.org/10.1016/j.cie.2020.106778
Chiang TC, Lin HJ (2013) A simple and effective evolutionary algorithm for multiobjective flexible job shop scheduling. Int J Prod Econ. https://doi.org/10.1016/j.ijpe.2012.03.034
Chou Y-C, Cao H, Cheng HH (2013) A bio-inspired mobile agent-based integrated system for flexible autonomic job shop scheduling. J Manuf Syst 32:752–763. https://doi.org/10.1016/j.jmsy.2013.01.005
Deng Q, Gong G, Gong X et al (2017) A bee evolutionary guiding nondominated sorting genetic algorithm II for multiobjective flexible job-shop scheduling. Comput Intell Neurosci 2017:1–20. https://doi.org/10.1155/2017/5232518
Ding H, Gu X (2020) Improved particle swarm optimization algorithm based novel encoding and decoding schemes for flexible job shop scheduling problem. Comput Oper Res. https://doi.org/10.1016/j.cor.2020.104951
Ennigrou M, Ghédira K (2008) New local diversification techniques for flexible job shop scheduling problem with a multi-agent approach. Auton Agent Multi Agent Syst. https://doi.org/10.1007/s10458-008-9031-3
Gao J, Sun L, Gen M (2008) A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems. Comput Oper Res. https://doi.org/10.1016/j.cor.2007.01.001
Gao KZ, Suganthan PN, Chua TJ et al (2015) A two-stage artificial bee colony algorithm scheduling flexible job-shop scheduling problem with new job insertion. Expert Syst Appl. https://doi.org/10.1016/j.eswa.2015.06.004
Gothwal S, Raj T (2018) Prioritising the performance measures of FMS using multi-criteria decision making approaches. Int J Process Manag Benchmarking. https://doi.org/10.1504/IJPMB.2018.088657
Gu M, Gu J, Lu X (2018) An algorithm for multi-agent scheduling to minimize the makespan on m parallel machines. J Sched 21:483–492. https://doi.org/10.1007/s10951-017-0546-9
Huang S, Tian N, Wang Y, Ji Z (2016) Multi-objective flexible job-shop scheduling problem using modified discrete particle swarm optimization. Springerplus. https://doi.org/10.1186/s40064-016-3054-z
Kacem I, Hammadi S, Borne P (2002a) Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic. Math Comput Simul 60:245–276. https://doi.org/10.1016/S0378-4754(02)00019-8
Kacem I, Hammadi S, Borne P (2002b) Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems. IEEE Trans Syst Man Cybern Part C Appl Rev. https://doi.org/10.1109/TSMCC.2002.1009117
Kouider A, Bouzouia B (2012) Multi-agent job shop scheduling system based on co-operative approach of idle time minimisation. Int J Prod Res. https://doi.org/10.1080/00207543.2010.539276
Lei D (2015) Variable neighborhood search for two-agent flow shop scheduling problem. Comput Ind Eng. https://doi.org/10.1016/j.cie.2014.11.024
Li H (2017) A variable neighborhood migrating birds optimization algorithm for flexible job shop scheduling. Int J Perform Eng 13:1020–1029
Li JQ, Pan QK, Liang YC (2010) An effective hybrid tabu search algorithm for multi-objective flexible job-shop scheduling problems. Comput Ind Eng 59:647–662. https://doi.org/10.1016/j.cie.2010.07.014
Li J-Q, Pan Q-K, Gao K-Z (2011a) Pareto-based discrete artificial bee colony algorithm for multi-objective flexible job shop scheduling problems. Int J Adv Manuf Technol 55:1159–1169. https://doi.org/10.1007/s00170-010-3140-2
Li J-Q, Pan Q-K, Suganthan PN, Chua TJ (2011b) A hybrid tabu search algorithm with an efficient neighborhood structure for the flexible job shop scheduling problem. Int J Adv Manuf Technol 52:683–697. https://doi.org/10.1007/s00170-010-2743-y
Li X, Peng Z, Du B et al (2017) Hybrid artificial bee colony algorithm with a rescheduling strategy for solving flexible job shop scheduling problems. Comput Ind Eng. https://doi.org/10.1016/j.cie.2017.09.005
Li H, Gajpal Y, Bector CR (2018a) Single machine scheduling with two-agent for total weighted completion time objectives. Appl Soft Comput 70:147–156. https://doi.org/10.1016/j.asoc.2018.05.027
Li S-S, Chen R-X, Li W-J (2018b) Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs. Arab J Sci Eng 43:969–978. https://doi.org/10.1007/s13369-017-2900-9
Li Y, Huang W, Wu R, Guo K (2020a) An improved artificial bee colony algorithm for solving multi-objective low-carbon flexible job shop scheduling problem. Appl Soft Comput J. https://doi.org/10.1016/j.asoc.2020.106544
Li Y, Wang J, Liu Z (2020b) An adaptive multi-objective evolutionary algorithm with two-stage local search for flexible job-shop scheduling. Int J Comput Intell Syst 14:54. https://doi.org/10.2991/ijcis.d.201104.001
Nouiri M, Bekrar A, Jemai A et al (2018) An effective and distributed particle swarm optimization algorithm for flexible job-shop scheduling problem. J Intell Manuf 29:603–615. https://doi.org/10.1007/s10845-015-1039-3
Peng C, Wu G, Liao TW, Wang H (2019) Research on multi-agent genetic algorithm based on tabu search for the job shop scheduling problem. PLoS ONE 14:e0223182. https://doi.org/10.1371/journal.pone.0223182
Rajabinasab A, Mansour S (2011) Dynamic flexible job shop scheduling with alternative process plans: an agent-based approach. Int J Adv Manuf Technol. https://doi.org/10.1007/s00170-010-2986-7
Shahsavari-Pour N, Ghasemishabankareh B (2013) A novel hybrid meta-heuristic algorithm for solving multi objective flexible job shop scheduling. J Manuf Syst. https://doi.org/10.1016/j.jmsy.2013.04.015
Shi L, Guo G, Song X (2019) Multi-agent based dynamic scheduling optimisation of the sustainable hybrid flow shop in a ubiquitous environment. Int J Prod Res. https://doi.org/10.1080/00207543.2019.1699671
Singh MR, Singh M, Mahapatra SS, Jagadev N (2016) Particle swarm optimization algorithm embedded with maximum deviation theory for solving multi-objective flexible job shop scheduling problem. Int J Adv Manuf Technol. https://doi.org/10.1007/s00170-015-8075-1
Sreekara Reddy MBS, Ratnam C, Rajyalakshmi G, Manupati VK (2018) An effective hybrid multi objective evolutionary algorithm for solving real time event in flexible job shop scheduling problem. Meas J Int Meas Confed. https://doi.org/10.1016/j.measurement.2017.09.022
Wang X, Gao L, Zhang C, Shao X (2010) A multi-objective genetic algorithm based on immune and entropy principle for flexible job-shop scheduling problem. Int J Adv Manuf Technol 51:757–767. https://doi.org/10.1007/s00170-010-2642-2
Wang L, Zhou G, Xu Y, Liu M (2012) An enhanced Pareto-based artificial bee colony algorithm for the multi-objective flexible job-shop scheduling. Int J Adv Manuf Technol 60:1111–1123. https://doi.org/10.1007/s00170-011-3665-z
Wang C, Ji Z, Wang Y (2017) Multi-objective flexible job shop scheduling problem using variable neighborhood evolutionary algorithm. Mod Phys Lett B 31:1740072
Wang L, Cai J, Li M, Liu Z (2017) Flexible job shop scheduling problem using an improved ant colony optimization. Sci Progr. https://doi.org/10.1155/2017/9016303
Wong TN, Zhang S, Wang G, Zhang L (2012) Integrated process planning and scheduling - Multi-agent system with two-stage ant colony optimisation algorithm. Int J Prod Res 50:6188–6201
Wu X, Wu S (2017) An elitist quantum-inspired evolutionary algorithm for the flexible job-shop scheduling problem. J Intell Manuf. https://doi.org/10.1007/s10845-015-1060-6
Xia W, Wu Z (2005) An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems. Comput Ind Eng 48:409–425. https://doi.org/10.1016/j.cie.2005.01.018
Xing LN, Chen YW, Yang KW (2009) An efficient search method for multi-objective flexible job shop scheduling problems. J Intell Manuf. https://doi.org/10.1007/s10845-008-0216-z
Xing LN, Chen YW, Yang KW (2009) Multi-objective flexible job shop schedule: Design and evaluation by simulation modeling. Appl Soft Comput J. https://doi.org/10.1016/j.asoc.2008.04.013
Xing LN, Chen YW, Wang P et al (2010) A knowledge-based ant colony optimization for flexible job shop scheduling problems. Appl Soft Comput J. https://doi.org/10.1016/j.asoc.2009.10.006
Xiong W, Fu D (2018) A new immune multi-agent system for the flexible job shop scheduling problem. J Intell Manuf. https://doi.org/10.1007/s10845-015-1137-2
Zarrouk R, Bennour IE, Jemai A (2019) A two-level particle swarm optimization algorithm for the flexible job shop scheduling problem. Swarm Intell 13:145–168. https://doi.org/10.1007/s11721-019-00167-w
Zhang S, Wong TN (2017) Flexible job-shop scheduling/rescheduling in dynamic environment: a hybrid MAS/ACO approach. Int J Prod Res. https://doi.org/10.1080/00207543.2016.1267414
Zhang G, Shao X, Li P, Gao L (2009) An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem. Comput Ind Eng. https://doi.org/10.1016/j.cie.2008.07.021
Zhang J, Jie J, Wang W, Xu X (2017) A hybrid particle swarm optimisation for multi-objective flexible job-shop scheduling problem with dual-resources constrained. Int J Comput Sci Math. https://doi.org/10.1504/IJCSM.2017.088956
Ziaee M (2014) A heuristic algorithm for solving flexible job shop scheduling problem. Int J Adv Manuf Technol. https://doi.org/10.1007/s00170-013-5510-z
Acknowledgements
This research is supported by the school-enterprise cooperation project of Tongji University under Grant No. kh0100020192160.
Funding
This research is supported by the school-enterprise cooperation project of Tongji University under Grant No. kh0100020192160.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
No conflict of interest exits in the submission of this manuscript.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Li, Y., Wang, J. & Liu, Z. A simple two-agent system for multi-objective flexible job-shop scheduling. J Comb Optim 43, 42–64 (2022). https://doi.org/10.1007/s10878-021-00748-8
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-021-00748-8