{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T06:42:04Z","timestamp":1777704124906,"version":"3.51.4"},"reference-count":59,"publisher":"SAGE Publications","issue":"3","license":[{"start":{"date-parts":[[2020,7,9]],"date-time":"2020-07-09T00:00:00Z","timestamp":1594252800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"published-print":{"date-parts":[[2020,10,7]]},"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.3233\/jifs-191839","type":"journal-article","created":{"date-parts":[[2020,7,10]],"date-time":"2020-07-10T10:23:28Z","timestamp":1594376608000},"page":"3475-3501","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":1,"title":["Introducing an effective meta-heuristic algorithm: Cosmogony algorithm (CA)"],"prefix":"10.1177","volume":"39","author":[{"given":"Nasser","family":"Shahsavari-Pour","sequence":"first","affiliation":[{"name":"Department of Industrial Management, Vali-e-Asr University, Rafsanjan, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hamed","family":"Mohammadi-Andargoli","sequence":"additional","affiliation":[{"name":"Department of Industrial Engineering, Islamic Azad University, South Tehran Branch, Tehran, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Najmeh","family":"Bahram-Pour","sequence":"additional","affiliation":[{"name":"Department of Industrial Engineering, Alzahra University, Tehran, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2020,7,9]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-015-1707-4"},{"key":"e_1_3_1_3_2","unstructured":"BersiniH. and VarelaF.J. Hints for adaptive problem solving gleaned from immune networks in International Conference on Parallel Problem Solving from Nature (1990) Springer."},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02023073"},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02238804"},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00940812"},{"key":"e_1_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(93)90023-A"},{"key":"e_1_3_1_8_2","unstructured":"DebK. Multi-objective optimization using evolutionary algorithms 16 (2001) John Wiley & Sons."},{"key":"e_1_3_1_9_2","unstructured":"DorigoM. Optimization learning and natural algorithms [Ph. D. thesis]. Politecnico di Milano Italy (1992)."},{"key":"e_1_3_1_10_2","unstructured":"Dr\u00e9oJ. et al. Metaheuristics for hard optimization: methods and case studies. 2006 Springer Science & Business Media."},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1006\/jcph.1993.1010"},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/0021-9991(90)90201-B"},{"key":"e_1_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(89)90002-3"},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-005-0021-x"},{"key":"e_1_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2007.01.001"},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2007.04.010"},{"key":"e_1_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1.2.117"},{"key":"e_1_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1111\/j.1540-5915.1977.tb01074.x"},{"key":"e_1_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1.3.190"},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(86)90050-X"},{"key":"e_1_3_1_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/321127.321128"},{"key":"e_1_3_1_22_2","unstructured":"JainV. et al. Scheduling of a flexible job-shop using a multi-objective genetic algorithm Journal of Advances in Management Research(2012)."},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-4754(02)00019-8"},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCC.2002.1009117"},{"key":"e_1_3_1_25_2","unstructured":"KennedyJ. and EberhartR. Particle swarm optimization in Proceedings of ICNN\u201995-International Conference on Neural Networks. (1995) IEEE."},{"key":"e_1_3_1_26_2","doi-asserted-by":"crossref","unstructured":"KhoukhiA. Prototyped genetic search: a cybernetical approach to job-shop scheduling problems Kybernetes (2002).","DOI":"10.1108\/03684920210413782"},{"key":"e_1_3_1_27_2","unstructured":"KozaJ.R. and KozaJ.R. Genetic programming: on the programming of computers by means of natural selection 1 (1992) MIT press."},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-010-2743-y"},{"key":"e_1_3_1_29_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2016.01.016"},{"key":"e_1_3_1_30_2","doi-asserted-by":"crossref","unstructured":"LiuD. et al. Efficient hybrid algorithms to solve mixed discrete-continuous optimization problems Engineering Computations (2018).","DOI":"10.1108\/EC-03-2017-0103"},{"key":"e_1_3_1_31_2","unstructured":"MartinO. OttoS.W. and FeltenE.W. Large-step Markov chains for the traveling salesman problem (1991) Citeseer."},{"key":"e_1_3_1_32_2","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1099-1425(200001\/02)3:1<3::AID-JOS32>3.0.CO;2-Y"},{"key":"e_1_3_1_33_2","unstructured":"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."},{"key":"e_1_3_1_34_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2010.08.004"},{"key":"e_1_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-015-1039-3"},{"key":"e_1_3_1_36_2","doi-asserted-by":"crossref","unstructured":"PachporP.S. et al. Application of Petri nets towards improved utilization of machines in job shop manufacturing environments Journal of Manufacturing Technology Management (2017).","DOI":"10.1108\/JMTM-05-2016-0064"},{"key":"e_1_3_1_37_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1016568309421"},{"key":"e_1_3_1_38_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2007.02.014"},{"key":"e_1_3_1_39_2","doi-asserted-by":"publisher","DOI":"10.1108\/17410381211267745"},{"key":"e_1_3_1_40_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.12.007"},{"key":"e_1_3_1_41_2","doi-asserted-by":"publisher","DOI":"10.1023\/B:JIMS.0000010078.30713.e9"},{"key":"e_1_3_1_42_2","unstructured":"SeeleyT. The Wisdom of the Hive Harvard University Press Cambridge Massachusetts London England (1995)."},{"key":"e_1_3_1_43_2","doi-asserted-by":"crossref","unstructured":"ShimM.B. et al. Pareto-based continuous evolutionary algorithms for multiobjective optimization Engineering Computations (2002).","DOI":"10.1108\/02644400210413649"},{"key":"e_1_3_1_44_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tree.2004.04.009"},{"key":"e_1_3_1_45_2","doi-asserted-by":"publisher","DOI":"10.1080\/002075498192896"},{"key":"e_1_3_1_46_2","doi-asserted-by":"crossref","unstructured":"TalbiE.-G. Metaheuristics: from design to implementation 74 (2009) John Wiley & Sons.","DOI":"10.1002\/9780470496916"},{"key":"e_1_3_1_47_2","first-page":"1","article-title":"A research survey: heuristic approaches for solving multi objective flexible job shop problems","volume":"2020","author":"T\u00fcrkyilmaz A.","unstructured":"T\u00fcrkyilmazA., et al., A research survey: heuristic approaches for solving multi objective flexible job shop problems, Journal of Intelligent Manufacturing 2020, 1\u201335.","journal-title":"Journal of Intelligent Manufacturing"},{"key":"e_1_3_1_48_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009665513140"},{"key":"e_1_3_1_49_2","doi-asserted-by":"crossref","unstructured":"WangG.-G. et al. A novel improved accelerated particle swarm optimization algorithm for global numerical optimization Engineering Computations (2014).","DOI":"10.1108\/EC-10-2012-0232"},{"key":"e_1_3_1_50_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(01)00197-7"},{"key":"e_1_3_1_51_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2010.05.016"},{"key":"e_1_3_1_52_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-010-2642-2"},{"key":"e_1_3_1_53_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2004.842412"},{"key":"e_1_3_1_54_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2005.01.018"},{"key":"e_1_3_1_55_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-008-0216-z"},{"key":"e_1_3_1_56_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2008.04.013"},{"key":"e_1_3_1_57_2","doi-asserted-by":"publisher","DOI":"10.1007\/s12597-019-00395-y"},{"key":"e_1_3_1_58_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2008.07.021"},{"issue":"2","key":"e_1_3_1_59_2","first-page":"223","article-title":"Multistage-based genetic algorithm for flexible job-shop scheduling problem","volume":"11","author":"Zhang H.","year":"2005","unstructured":"ZhangH. and GenM., Multistage-based genetic algorithm for flexible job-shop scheduling problem, Journal of Complexity International 11(2) (2005), 223\u2013232.","journal-title":"Journal of Complexity International"},{"key":"e_1_3_1_60_2","doi-asserted-by":"crossref","unstructured":"ZouY. The whirlpool algorithm based on physical phenomenon for solving optimization problems Engineering Computations (2019).","DOI":"10.1108\/EC-05-2017-0174"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-191839","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/JIFS-191839","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-191839","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:40:30Z","timestamp":1777455630000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/JIFS-191839"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,9]]},"references-count":59,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,10,7]]}},"alternative-id":["10.3233\/JIFS-191839"],"URL":"https:\/\/doi.org\/10.3233\/jifs-191839","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,7,9]]}}}