The purpose of this paper is to introduce a new meta-heuristic algorithm and apply this for solving a multi-objective flexible job-shop scheduling problem. The name of this algorithm is Cosmogony (CA). This algorithm has inspired by the ecosystem process of creatures and their environment. For a better understanding, we make an effort to apply the concepts of the meta-heuristic algorithms up to a possible extent. This algorithm identifies local optimal points during the self-search process of problem-solving. Initial creatures have been generated randomly in a certain number. This algorithm incorporates many features of the other algorithms in itself. So that to prove the ability and efficiency of CA, a flexible job-shop scheduling problem has surveyed. This problem is in a Non-resumable situation with maintenance activity constraints in a two-time fixed and non-fixed state. The algorithm performance is evaluated by numerical experiments. The result has shown the proposed approach is more efficient and appropriate than the other methods. It also has high power in the searching process in the feasible region of the multi-objective flexible job-shop scheduling problem and high converge power.
ArqubO.A., et al., Numerical solutions of fuzzy differential equations using reproducing kernel Hilbert space method, Soft Computing20(8) (2016), 3283–3302.
2.
BersiniH. and VarelaF.J., Hints for adaptive problem solving gleaned from immune networks, in International Conference on Parallel Problem Solving from Nature (1990), Springer.
3.
BrandimarteP., Routing and scheduling in a flexible job shop by tabu search, Annals of Operations Research41(3) (1993), 157–183.
4.
BruckerP. and SchlieR., Job-shop scheduling with multi-purpose machines, Computing45(4) (1990), 369–375.
5.
ČernýV., Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm, Journal of Optimization Theory and Applications45(1) (1985), 41–51.
6.
CharonI. and HudryO., The noising method: a new method for combinatorial optimization, Operations Research Letters14(3) (1993), 133–137.
7.
DebK., Multi-objective optimization using evolutionary algorithms, 16 (2001), John Wiley & Sons.
8.
DorigoM., Optimization, learning and natural algorithms [Ph. D. thesis]. Politecnico di Milano, Italy, (1992).
9.
DréoJ., et al., Metaheuristics for hard optimization: methods and case studies. 2006 Springer Science & Business Media.
10.
DueckG., New optimization heuristics: The great deluge algorithm and the record-to-record travel, Journal of Computational Physics104(1) (1993), 86–92.
11.
DueckG. and ScheuerT., Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing, Journal of Computational Physics90(1) (1990), 161–175.
12.
FeoT.A. and ResendeM.G., A probabilistic heuristic for a computationally difficult set covering problem, Operations Research Letters8(2) (1989), 67–71.
13.
GaoJ., GenM. and SunL., Scheduling jobs and maintenances in flexible job shop with a hybrid genetic algorithm, Journal of Intelligent Manufacturing17(4) (2006), 493–507.
14.
GaoJ., SunL. and GenM., A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems, Computers & Operations Research35(9) (2008), 2892–2907.
15.
GaoJ., et al., A hybrid of genetic algorithm and bottleneck shifting for multiobjective flexible job shop scheduling problems, Computers & Industrial Engineering53(1) (2007), 149–162.
16.
GareyM.R., JohnsonD.S. and SethiR., The complexity of flowshop and jobshop scheduling, Mathematics of Operations Research1(2) (1976), 117–129.
17.
GloverF., Heuristics for integer programming using surrogate constraints, Decision Sciences8(1) (1977), 156–166.
18.
GloverF., Tabu search—part I, ORSA Journal on Computing1(3) (1989), 190–206.
19.
GloverF. and McMillanC., The general employee scheduling problem, An integration of MS and AI, Computers & Operations Research13(5) (1986), 563–573.
20.
HollandJ.H., Outline for a logical theory of adaptive systems, Journal of the ACM (JACM)9(3) (1962), 297–314.
21.
JainV., et al., Scheduling of a flexible job-shop using a multi-objective genetic algorithm, Journal of Advances in Management Research(2012).
22.
KacemI., HammadiS. and BorneP., Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic, Mathematics and Computers in Simulation60(3–5) (2002), 245–276.
23.
KacemI., HammadiS. and BorneP., Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems, IEEE Transactions on Systems Man and Cybernetics Part C (Applications and Reviews)32(1) (2002), 1–13.
24.
KennedyJ. and EberhartR., Particle swarm optimization, in Proceedings of ICNN’95-International Conference on Neural Networks. (1995), IEEE.
25.
KhoukhiA., Prototyped genetic search: a cybernetical approach to job-shop scheduling problems, Kybernetes (2002).
26.
KozaJ.R. and KozaJ.R., Genetic programming: on the programming of computers by means of natural selection, 1 (1992), MIT press.
27.
LiJ.-Q., et al., A hybrid tabu search algorithm with an efficient neighborhood structure for the flexible job shop scheduling problem, The International Journal of Advanced Manufacturing Technology52(5–8) (2011), 683–697.
28.
LiX. and GaoL., An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem, International Journal of Production Economics174 (2016), 93–110.
29.
LiuD., et al., Efficient hybrid algorithms to solve mixed discrete-continuous optimization problems, Engineering Computations (2018).
30.
MartinO., OttoS.W. and FeltenE.W., Large-step Markov chains for the traveling salesman problem, (1991), Citeseer.
31.
MastrolilliM. and GambardellaL.M., Effective neighbourhood functions for the flexible job shop problem, Journal of Scheduling3(1) (2000), 3–20.
32.
MatiY., RezgN. and XieX., An integrated greedy heuristic for a flexible job shop scheduling problem, in 2001 IEEE International Conference on Systems, Man and Cybernetics. e-Systems and e-Man for Cybernetics in Cyberspace (Cat. No. 01CH37236). (2001), IEEE.
33.
MoslehiG. and MahnamM., A Pareto approach to multi-objective flexible job-shop scheduling problem using particle swarm optimization and local search, International Journal of Production Economics129(1) (2011), 14–22.
34.
NouiriM., et al., An effective and distributed particle swarm optimization algorithm for flexible job-shop scheduling problem, Journal of Intelligent Manufacturing29(3) (2018), 603–615.
35.
PachporP.S., et al., Application of Petri nets towards improved utilization of machines in job shop manufacturing environments, Journal of Manufacturing Technology Management (2017).
36.
ParsopoulosK.E. and VrahatisM.N., Recent approaches to global optimization problems through particle swarm optimization, Natural Computing1(2-3) (2002), 235–306.
37.
PezzellaF., MorgantiG. and CiaschettiG., A genetic algorithm for the flexible job-shop scheduling problem, Computers & Operations Research35(10) (2008), 3202–3212.
38.
PhandenR.K., JainA. and VermaR., A genetic algorithm-based approach for job shop scheduling, Journal of Manufacturing Technology Management23(7) (2012), 937–946.
39.
RuizR., García-DíazJ.C. and MarotoC., Considering scheduling and preventive maintenance in the flowshop sequencing problem, Computers & Operations Research34(11) (2007), 3314–3330.
40.
ScrichC.R., ArmentanoV.A. and LagunaM., Tardiness minimization in a flexible job shop: A tabu search approach, Journal of Intelligent Manufacturing15(1) (2004), 103–115.
41.
SeeleyT., The Wisdom of the Hive Harvard University Press, Cambridge, Massachusetts, London, England, (1995).
42.
ShimM.B., et al., Pareto-based continuous evolutionary algorithms for multiobjective optimization, Engineering Computations (2002).
43.
SihA., BellA. and JohnsonJ.C., Behavioral syndromes: an ecological and evolutionary overview, Trends in Ecology & Evolution19(7) (2004), 372–378.
44.
SonmezA. and BaykasogluA., A new dynamic programming formulation of (nxm) flowshop sequencing problems with due dates, International Journal of Production Research36(8) (1998), 2269–2283.
45.
TalbiE.-G., Metaheuristics: from design to implementation, 74 (2009), John Wiley & Sons.
46.
TürkyilmazA., et al., A research survey: heuristic approaches for solving multi objective flexible job shop problems, Journal of Intelligent Manufacturing2020, 1–35.
47.
VoudourisC., Guided Local Search—An illustrative example in function optimisation, BT Technology Journal16(3) (1998), 46–50.
48.
WangG.-G., et al., A novel improved accelerated particle swarm optimization algorithm for global numerical optimization, Engineering Computations (2014).
49.
WangH., A survey of maintenance policies of deteriorating systems, European Journal of Operational Research139(3) (2002), 469–489.
50.
WangS. and YuJ., An effective heuristic for flexible job-shop scheduling problem with maintenance activities, Computers & Industrial Engineering59(3) (2010), 436–447.
51.
WangX., et al., A multi-objective genetic algorithm based on immune and entropy principle for flexible job-shop scheduling problem, The International Journal of Advanced Manufacturing Technology51(5-8) (2010), 757–767.
52.
WuZ. and WengM.X., Multiagent scheduling method with earliness and tardiness objectives in flexible job shops, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics)35 (2) (2005), 293–301.
53.
XiaW. and WuZ., An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems, Computers & Industrial Engineering48 (2) (2005), 409–425.
54.
XingL.-N., ChenY.-W. and YangK.-W., An efficient search method for multi-objective flexible job shop scheduling problems, Journal of Intelligent Manufacturing20(3) (2009), 283–293.
55.
XingL.-N., ChenY.-W. and YangK.-W., Multi-objective flexible job shop schedule: Design and evaluation by simulation modeling, Applied Soft Computing9(1) (2009), 362–376.
56.
YazdaniM., ZandiehM. and Tavakkoli-MoghaddamR., Evolutionary algorithms for multi-objective dual-resource constrained flexible job-shop scheduling problem, Opsearch56(3) (2019), 983–1006.
57.
ZhangG., et al., An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem, Computers & Industrial Engineering56(4) (2009), 1309–1318.
58.
ZhangH. and GenM., Multistage-based genetic algorithm for flexible job-shop scheduling problem, Journal of Complexity International11(2) (2005), 223–232.
59.
ZouY., The whirlpool algorithm based on physical phenomenon for solving optimization problems, Engineering Computations (2019).
