This paper presents a multi-objective mathematical model for a flexible job shop scheduling problem (FJSSP) with fuzzy processing times, which is solved by a hybrid intelligent algorithm (HIA). This problem contains a combination of a classical job shop problem with parallel machines (JSPM) to provide flexibility in the production route. Despite the previous studies, the number of parallel machines is not pre-specified in this paper. This constraint with other ones (e.g., sequence-dependent setup times, reentrant workflows, and fuzzy variables) makes the given problem more complex. To solve such a multi-objective JSPM, Pareto-based optimization algorithms based on multi-objective meta-heuristics and multi-criteria decision making (MCDM) methods are utilized. Then, different comparison metrics (e.g., quality, mean ideal distance, and rate of achievement simultaneously) are used. Also, this paper includes two major phases to provide a new model of the FJSSP and introduce a new proposed HIA for solving the presented model, respectively. This algorithm is a hybrid genetic algorithm with the SAW/TOPSIS method, namely HGASAW/HGATOPSIS. The comparative results indicate that HGASAW and HGATOPSIS outperform the non-dominated sorting genetic algorithm (NSGA-II) to tackle the fuzzy multi-objective JSPM.
PinedoM.L., Scheduling, Theory, Algorithms and Systems (4th ed.), New York, Springer, 2010.
2.
GomesM.C., Barbosa-PóvoaA.P. and NovaisA.Q., Optimal scheduling for flexible job shop operation, International Journal of Production Research43 (2005), 2323–2353.
3.
LiuS.Q. and KozanE., Scheduling trains as a blocking parallel-machine job shop scheduling problem, Computers and Operations Research36 (2009), 2840–2852.
4.
RossiA. and BoschiE., A hybrid heuristic to solve the parallel machines job-shop scheduling problem, Advances in Engineering Software40 (2009), 118–127.
5.
BozejkoW., UchronskiM. and WodeckiM., Parallel hybrid metaheuristics for the flexible job shop problem, Computers & Industrial Engineering59 (2010), 323–333.
6.
ChanF.T.S., ChoyK.L. and Bibhushan, A genetic algorithm-based scheduler for multi-product parallel machine sheet metal job shop, Expert Systems with Applications38 (2011), 8703–8715.
7.
GholamiO. and SotskovY.N., Solving parallel machines job-shop scheduling problems by an adaptive algorithm, International Journal of Production Research52 (2014), 3888–3904.
8.
LiuS.Q and KozanE., Parallel-identical-machine job-shop scheduling with different stage-dependent buffering requirements, Computers and Operations Research74 (2016), 31–41.
9.
GuoJ. and YangH., An anti-jamming artificial immune approach for energy leakage diagnosis in parallel-machine job shops, Computers in Industry101 (2018), 13–24.
10.
NaderiB., KhaliliM. and Tavakkoli-MoghaddamR., A hybrid artificial immune algorithm for a realistic variant of job shops to minimize the total completion time, Computers and Industrial Engineering56 (2009), 1494–1501.
11.
YuliantyA. and Ma’rufA., Predictive Approach on Flexible Job Shop Scheduling Problem Considering Controllable Processing Times, International Journal of Innovation, Management and Technology4 (2013), 565–569.
12.
SunD., HeW., ZhengL. and LiaoaX., Scheduling flexible job shop problem subject to machine breakdown with game theory, International Journal of Production Research52 (2014), 3858–3876.
13.
MeolicR. and BrezočnikZ., Flexible job shop scheduling using zero-suppressed binary decision diagrams, Advances in Production Engineering and Management13 (2018), 373–388.
14.
KonakA., CoitD.W. and SmithA.E., Multi-objective optimization using genetic algorithms: A tutorial, Reliability Engineering and System Safety91 (2006), 992–1007.
15.
DebK. and MeyarivanT., A fast and elitist multiobjective genetic algorithm: NSGA-II, IEEE Transactions on Evolutionary Computation6 (2002), 182–197.
16.
Tavakkoli-MoghaddamR., AzarkishM. and Sadeghnejad-BarkousaraieA., A new hybrid multi-objective Pareto archive PSO algorithm for a bi-objective job shop scheduling problem, Expert Systems with Applications38 (2011), 10812–10821.
17.
Tavakkoli-MoghaddamR., AzarkishM. and Sadeghnejad-BarkousaraieA., Solving a multi-objective job shop scheduling problem with sequence-dependent setup times by a Pareto archive PSO combined with genetic operators and VNS, The International Journal of Advanced Manufacturing Technology53 (2011), 733–750.
18.
DousthaghiS., Tavakkoli-MoghaddamR. and MakuiA., Solving the economic lot and delivery scheduling problem in a flexible job shop with unrelated parallel machines and a shelf life by a proposed hybrid PSO, The International Journal of Advanced Manufacturing Technology68 (2013), 1401–1416.
19.
YazdaniM., ZandiehM., Tavakkoli-MoghaddamR. and JolaiF., Two meta-heuristic algorithms for the dual-resource constrained flexible job-shop scheduling problem, Scientia Iranica –Transaction E22 (2015), 1242–1257.
20.
AhmadiE., ZandiehM., FarrokhM. and EmamiS.M., A multi objective optimization approach for flexible job shop scheduling problem under random machine breakdown by evolutionary algorithms, Computers and Operations Research73 (2016), 56–66.
21.
YazdaniM., ZandiehM. and Tavakkoli-MoghaddamR., Evolutionary algorithms for multi-objective dual-resource constrained flexible job-shop scheduling problem, OPSEARCH56 (2019), 983–1006.
22.
LuC., LiX., GaoL., LiaoW. and YiJ., An effective multi-objective discrete virus optimization algorithm for flexible job-shop scheduling problem with controllable processing times, Computers and Industrial Engineering104 (2017), 156–174.
23.
GongG., DengO., GongX., LiuW. and RenQ., A new double flexible job-shop scheduling problem integrating processing time, green production, and human factor indicators, Journal of Cleaner Production174 (2018), 560–576.
24.
LinY., ChangP.C., YengL.C. and HuangS.F., Bi-objective optimization for a multistate job-shop production network using NSGA-II and TOPSIS, Journal of Manufacturing Systems52 (2019), 43–54.
25.
AbbasbandyS. and HajjariT., A new approach for ranking of trapezoidal fuzzy numbers, Computers & Mathematics with Applications57 (2009), 413–419.
26.
MengL., ZhangC., ShaoX., ZhangB., RenY. and LinW., More MILP models for hybrid flow shop scheduling problem and its extended problems, International Journal of Production Research58 (2020), 3905–3930.
27.
MengL., ZhangC., RenY., ZhangB. and LvC., Mixed-integer linear programming and constraint programming formulations for solving distributed flexible job shop scheduling problem, Computers & Industrial Engineering142 (2020), 106347.
28.
NaderiB. and AzabA., Modeling and heuristics for scheduling of distributed job shops, Expert Systems with Applications41 (2014), 7754–7763.
29.
SakawaM. and MoriT., An efficient genetic algorithm for job-shop scheduling problems with fuzzy processing time and fuzzy duedate, Computers and Industrial Engineering36 (1999), 325–341.
30.
MavrotasG., Effective implementation of the ɛ-constraint method in Multi-Objective Mathematical Programming problems, Applied Mathematics and Computation213 (2019), 455–465.
31.
KasemI., HammadiS. and BorneP., Pareto-optimality approach for flexible job-shop scheduling problems: Hybridization of evolutionary algorithms and fuzzy logic, Mathematics and Computers in Simulation60 (2002), 245–276.
32.
WangX., GaoL., ZhangC. and ShaoX., A multi-objective genetic algorithm based on immune and entropy principle for flexible job-shop scheduling problem, The International Journal of Advanced Manufacturing Technology51 (2010), 757–767.
33.
WangL., WangS. and LiuM., A Pareto-based estimation of distribution algorithm for the multi-objective flexible job-shop scheduling problem, International Journal of Production Research51 (2013), 3574–3592.
34.
GhasemishabankarehB., Shahsavari-PourN., BasiriM.A. and LiX., A hybrid imperialist competitive algorithm for the flexible job shop problem, Australasian Conference on Artificial Life and Computational Intelligence in Canberra, ACT, Australia, 2016, 221–233.
35.
MoradiH., ZandiehM. and MahdaviIraj, Non-dominated ranked genetic algorithm for a multi-objective mixed-model assembly line sequencing problem, International Journal of Production Research49 (2011), 3479–3499.
