{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,8]],"date-time":"2026-06-08T22:20:22Z","timestamp":1780957222726,"version":"3.54.1"},"reference-count":64,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,1,28]],"date-time":"2021-01-28T00:00:00Z","timestamp":1611792000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,28]],"date-time":"2021-01-28T00:00:00Z","timestamp":1611792000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Evol. Intel."],"published-print":{"date-parts":[[2021,9]]},"DOI":"10.1007\/s12065-020-00556-9","type":"journal-article","created":{"date-parts":[[2021,1,28]],"date-time":"2021-01-28T10:44:04Z","timestamp":1611830644000},"page":"1355-1366","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Lunar cycle inspired PSO for single machine total weighted tardiness scheduling problem"],"prefix":"10.1007","volume":"14","author":[{"given":"Shruti","family":"Gupta","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3113-4637","authenticated-orcid":false,"given":"Rajani","family":"Kumari","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rishi Pal","family":"Singh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,1,28]]},"reference":[{"issue":"2","key":"556_CR1","first-page":"633","volume":"41","author":"S Jain","year":"2020","unstructured":"Jain S, Kumar S, Sharma VK, Poonia RC, Lamba NP (2020) Modified differential evolution algorithm for solving minimum spanning tree. J Inf Optim Sci 41(2):633\u2013639","journal-title":"J Inf Optim Sci"},{"key":"556_CR2","first-page":"1","volume":"2","author":"S Pandey","year":"2013","unstructured":"Pandey S, Kumar S (2013) Enhanced artificial bee colony algorithm and its application to travelling salesman problem. Int J Technol Innov Res 2:1\u201310","journal-title":"Int J Technol Innov Res"},{"issue":"2","key":"556_CR3","first-page":"669","volume":"41","author":"A Goyal","year":"2020","unstructured":"Goyal A, Sharma VK, Kumar S, Kumar K (2020) Modified local link failure recovery multicast routing protocol for MANET. J Inf Optim Sci 41(2):669\u2013677","journal-title":"J Inf Optim Sci"},{"issue":"2","key":"556_CR4","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1080\/09720502.2020.1731974","volume":"23","author":"S Jain","year":"2020","unstructured":"Jain S, Kumar S, Sharma VK, Poonia RC (2020) Peregrine preying pattern based differential evolution for robot path planning. J Interdiscip Math 23(2):555\u2013562","journal-title":"J Interdiscip Math"},{"key":"556_CR5","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/978-981-15-0222-4_50","volume-title":"Advances in computing and intelligent systems","author":"S Jain","year":"2020","unstructured":"Jain S, Sharma VK, Kumar S (2020) Robot path planning using differential evolution. In: Sharma H, Govindan K, Poonia RC, Kumar S, Wael M (eds) Advances in computing and intelligent systems. Springer, Berlin, pp 531\u2013537"},{"key":"556_CR6","doi-asserted-by":"crossref","unstructured":"Nayyar A, Nguyen NG, Kumari R, Kumar S (2020) Robot path planning using modified artificial bee colony algorithm. In: Frontiers in intelligent computing: theory and applications. Springer, Berlin, pp 25\u201336","DOI":"10.1007\/978-981-13-9920-6_3"},{"issue":"4","key":"556_CR7","first-page":"5057","volume":"5","author":"S Kumar","year":"2014","unstructured":"Kumar S, Jadon P (2014) A novel hybrid algorithm for permutation flow shop scheduling. Int J Comput Sci Inf Technol 5(4):5057\u20135061","journal-title":"Int J Comput Sci Inf Technol"},{"key":"556_CR8","first-page":"1","volume":"7","author":"R Kumari","year":"2014","unstructured":"Kumari R, Sharma VK, Kumar S (2014) Fuzzified job shop scheduling algorithm. Int J Technol Innov Res 7:1\u201320","journal-title":"Int J Technol Innov Res"},{"key":"556_CR9","doi-asserted-by":"publisher","first-page":"74315","DOI":"10.1109\/ACCESS.2020.2986493","volume":"8","author":"SS Manju","year":"2020","unstructured":"Manju SS, Kumar S, Nayyar A, Al-Turjman F, Mostarda L et al (2020) Proficient QoS-based target coverage problem in wireless sensor networks. IEEE Access 8:74315\u201374325","journal-title":"IEEE Access"},{"key":"556_CR10","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"JK Lenstra","year":"1977","unstructured":"Lenstra JK, Kan AR, Brucker P (1977) Complexity of machine scheduling problems. Ann Discret Math 1:343\u2013362","journal-title":"Ann Discret Math"},{"issue":"3","key":"556_CR11","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1287\/opre.26.3.444","volume":"26","author":"L Schrage","year":"1978","unstructured":"Schrage L, Baker KR (1978) Dynamic programming solution of sequencing problems with precedence constraints. Oper Res 26(3):444\u2013449","journal-title":"Oper Res"},{"key":"556_CR12","doi-asserted-by":"crossref","unstructured":"Jouglet A, Baptiste P, Carlier J (2002) Exact procedures for single machine total cost scheduling. In: 2002 IEEE international conference on systems, man and cybernetics. vol\u00a06. IEEE, pp 4","DOI":"10.1109\/ICSMC.2002.1175623"},{"issue":"2","key":"556_CR13","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1287\/opre.33.2.363","volume":"33","author":"CN Potts","year":"1985","unstructured":"Potts CN, Van Wassenhove LN (1985) A branch and bound algorithm for the total weighted tardiness problem. Oper Res 33(2):363\u2013377","journal-title":"Oper Res"},{"issue":"6","key":"556_CR14","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/s10951-008-0093-5","volume":"12","author":"S Tanaka","year":"2009","unstructured":"Tanaka S, Fujikuma S, Araki M (2009) An exact algorithm for single-machine scheduling without machine idle time. J Sched 12(6):575\u2013593","journal-title":"J Sched"},{"key":"556_CR15","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization. In: IEEE international conference on neural networks, 1995. Proceedings, vol\u00a04. IEEE, pp 1942\u20131948","DOI":"10.1109\/ICNN.1995.488968"},{"key":"556_CR16","unstructured":"Karaboga D (2005) An idea based on honey bee swarm for numerical optimization. Technical Report TR06, Erciyes Univ Press, Erciyes"},{"issue":"1","key":"556_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4018\/jsir.2010010101","volume":"1","author":"KM Passino","year":"2010","unstructured":"Passino KM (2010) Bacterial foraging optimization. Int J Swarm Intell Res IJSIR 1(1):1\u201316","journal-title":"Int J Swarm Intell Res IJSIR"},{"issue":"5","key":"556_CR18","first-page":"437","volume":"118","author":"A Sharma","year":"2018","unstructured":"Sharma A, Chaturvedi R, Dwivedi U, Kumar S, Reddy S (2018) Firefly algorithm based effective gray scale image segmentation using multilevel thresholding and entropy function. Int J Pure Appl Math 118(5):437\u2013443","journal-title":"Int J Pure Appl Math"},{"key":"556_CR19","first-page":"79","volume":"20","author":"XS Yang","year":"2008","unstructured":"Yang XS et al (2008) Firefly algorithm. Nat Inspir Metaheur Algorithms 20:79\u201390","journal-title":"Nat Inspir Metaheur Algorithms"},{"key":"556_CR20","doi-asserted-by":"crossref","unstructured":"Yang XS, Deb S (2009) Cuckoo search via L\u00e9vy flights. In: 2009, World congress on nature and biologically inspired computing (NaBIC). IEEE, pp 210\u2013214","DOI":"10.1109\/NABIC.2009.5393690"},{"key":"556_CR21","doi-asserted-by":"crossref","unstructured":"Kumar S, Kumari R (2018) Artificial bee colony, firefly swarm optimization, and bat algorithms. In: Advances in swarm intelligence for optimizing problems in computer science. pp 145\u2013182","DOI":"10.1201\/9780429445927-6"},{"issue":"5","key":"556_CR22","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1504\/IJBIC.2011.042259","volume":"3","author":"XS Yang","year":"2011","unstructured":"Yang XS (2011) Bat algorithm for multi-objective optimisation. Int J Bio Inspir Comput 3(5):267\u2013274","journal-title":"Int J Bio Inspir Comput"},{"key":"556_CR23","doi-asserted-by":"crossref","unstructured":"Bhambu P, Kumar S (2016) Levy flight based animal migration optimization algorithm. In: 2016 international conference on recent advances and innovations in engineering (ICRAIE). IEEE, pp 1\u20135","DOI":"10.1109\/ICRAIE.2016.7939570"},{"issue":"7\u20138","key":"556_CR24","doi-asserted-by":"publisher","first-page":"1867","DOI":"10.1007\/s00521-013-1433-8","volume":"24","author":"X Li","year":"2014","unstructured":"Li X, Zhang J, Yin M (2014) Animal migration optimization: an optimization algorithm inspired by animal migration behavior. Neural Comput Appl 24(7\u20138):1867\u20131877","journal-title":"Neural Comput Appl"},{"issue":"1","key":"556_CR25","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s12293-013-0128-0","volume":"6","author":"JC Bansal","year":"2014","unstructured":"Bansal JC, Sharma H, Jadon SS, Clerc M (2014) Spider monkey optimization algorithm for numerical optimization. Memet Comput 6(1):31\u201347","journal-title":"Memet Comput"},{"key":"556_CR26","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1016\/j.procs.2015.08.504","volume":"62","author":"S Kumar","year":"2015","unstructured":"Kumar S, Kumari R, Sharma VK (2015) Fitness based position update in spider monney optimization algorithm. Procedia Comput Sci 62:442\u2013449","journal-title":"Procedia Comput Sci"},{"key":"556_CR27","doi-asserted-by":"crossref","unstructured":"Sharma H, Bansal JC, Arya K (2013) Diversity measures in artificial bee colony. In: Proceedings of seventh international conference on bio-inspired computing: theories and applications (BIC-TA 2012). Springer, Berlin, pp 299\u2013314","DOI":"10.1007\/978-81-322-1038-2_26"},{"key":"556_CR28","volume-title":"Genetic algorithms in search, optimization, and machine learning","author":"DE Goldberg","year":"1989","unstructured":"Goldberg DE (1989) Genetic algorithms in search, optimization, and machine learning. Addison-wesley, New York"},{"key":"556_CR29","doi-asserted-by":"crossref","unstructured":"Kumar S, Jain S, Sharma H (2018) Genetic algorithms. In: Advances in swarm intelligence for optimizing problems in computer science. pp 27\u201352","DOI":"10.1201\/9780429445927-2"},{"key":"556_CR30","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1007\/978-981-13-1595-4_73","volume-title":"Soft computing for problem solving","author":"P Sharma","year":"2019","unstructured":"Sharma P, Sharma H, Kumar S, Bansal JC (2019) A review on scale factor strategies in differential evolution algorithm. In: Bansal JC, Das KN, Nagar A, Deep K, Ojha AK (eds) Soft computing for problem solving. Springer, Berlin, pp 925\u2013943"},{"key":"556_CR31","doi-asserted-by":"publisher","first-page":"1009","DOI":"10.1007\/978-981-13-0761-4_95","volume-title":"Harmony search and nature inspired optimization algorithms","author":"P Sharma","year":"2019","unstructured":"Sharma P, Sharma H, Kumar S, Sharma K (2019) Black-hole gbest differential evolution algorithm for solving robot path planning problem. In: Dhiman G, Kumar V (eds) Harmony search and nature inspired optimization algorithms. Springer, Berlin, pp 1009\u20131022"},{"key":"556_CR32","volume-title":"Differential evolution-a simple and efficient adaptive scheme for global optimization over continuous spaces","author":"R Storn","year":"1995","unstructured":"Storn R, Price K (1995) Differential evolution-a simple and efficient adaptive scheme for global optimization over continuous spaces. International Computer Science Institute, New York"},{"key":"556_CR33","doi-asserted-by":"crossref","unstructured":"Rana PS, Sharma H, Bhattacharya M, Shukla A (2012) Guided reproduction in differential evolution. In: Asia-pacific conference on simulated evolution and learning. Springer, Berlin, pp 117\u2013127","DOI":"10.1007\/978-3-642-34859-4_12"},{"key":"556_CR34","doi-asserted-by":"crossref","unstructured":"Tasgetiren MF, Sevkli M, Liang YC, Gencyilmaz G (2004) Particle swarm optimization algorithm for single machine total weighted tardiness problem. In: Evolutionary computation, 2004. CEC2004. Congress on. vol\u00a02. IEEE, pp 1412\u20131419","DOI":"10.1109\/CEC.2004.1331062"},{"issue":"2","key":"556_CR35","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/j.ejor.2004.04.013","volume":"165","author":"TE Cheng","year":"2005","unstructured":"Cheng TE, Ng C, Yuan J, Liu Z (2005) Single machine scheduling to minimize total weighted tardiness. Eur J Oper Res 165(2):423\u2013443","journal-title":"Eur J Oper Res"},{"issue":"3","key":"556_CR36","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/j.tcs.2005.11.039","volume":"355","author":"SG Kolliopoulos","year":"2006","unstructured":"Kolliopoulos SG, Steiner G (2006) Approximation algorithms for minimizing the total weighted tardiness on a single machine. Theoret Comput Sci 355(3):261\u2013273","journal-title":"Theoret Comput Sci"},{"key":"556_CR37","doi-asserted-by":"crossref","unstructured":"Ferrolho A, Cris\u00f3stomo M (2007) Single machine total weighted tardiness problem with genetic algorithms. In: Computer systems and applications, 2007. AICCSA\u201907. IEEE\/ACS international conference on. IEEE, pp 1\u20138","DOI":"10.1109\/AICCSA.2007.370857"},{"issue":"6","key":"556_CR38","doi-asserted-by":"publisher","first-page":"1900","DOI":"10.1016\/j.cor.2008.06.007","volume":"36","author":"MF Tasgetiren","year":"2009","unstructured":"Tasgetiren MF, Pan QK, Liang YC (2009) A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times. Comput Oper Res 36(6):1900\u20131915","journal-title":"Comput Oper Res"},{"issue":"4","key":"556_CR39","first-page":"456","volume":"4","author":"F Ahmadizar","year":"2011","unstructured":"Ahmadizar F, Hosseini L (2011) A novel ant colony algorithm for the single-machine total weighted tardiness problem with sequence dependent setup times. Int J Comput Intell Syst 4(4):456\u2013466","journal-title":"Int J Comput Intell Syst"},{"issue":"5","key":"556_CR40","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1016\/j.cor.2011.07.022","volume":"39","author":"Y Yin","year":"2012","unstructured":"Yin Y, Wu CC, Wu WH, Cheng SR (2012) The single-machine total weighted tardiness scheduling problem with position-based learning effects. Comput Oper Res 39(5):1109\u20131116","journal-title":"Comput Oper Res"},{"key":"556_CR41","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1016\/j.promfg.2015.11.075","volume":"4","author":"B Santosa","year":"2015","unstructured":"Santosa B, Safitri AL (2015) Biogeography-based optimization (BBO) algorithm for single machine total weighted tardiness problem (SMTWTP). Procedia Manuf 4:552\u2013557","journal-title":"Procedia Manuf"},{"issue":"1","key":"556_CR42","first-page":"23","volume":"1","author":"M Marichelvam","year":"2016","unstructured":"Marichelvam M, Geetha M (2016) A hybrid cuckoo search metaheuristic algorithm for solving single machine total weighted tardiness scheduling problems with sequence dependent setup times. Int J Comput Complex Intell Algorithms 1(1):23\u201334","journal-title":"Int J Comput Complex Intell Algorithms"},{"key":"556_CR43","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.cie.2017.04.006","volume":"108","author":"J Ding","year":"2017","unstructured":"Ding J, L\u00fc Z, Cheng T, Xu L (2017) A hybrid evolutionary approach for the single-machine total weighted tardiness problem. Comput Ind Eng 108:70\u201380","journal-title":"Comput Ind Eng"},{"key":"556_CR44","doi-asserted-by":"crossref","unstructured":"Petrynski K, Szost R, Pozniak-Koszalka I, Koszalka L, Kasprzak A (2018) Single machine weighted tardiness problem: an algorithm and experimentation system. In: International conference on computational collective intelligence. Springer, Berlin, pp 36\u201344","DOI":"10.1007\/978-3-319-98446-9_4"},{"issue":"2","key":"556_CR45","first-page":"230","volume":"80","author":"L Chaabane","year":"2019","unstructured":"Chaabane L (2019) A novel hybrid algorithm for minimizing total weighted tardiness cost. Comput Sci J Moldova 80(2):230\u2013241","journal-title":"Comput Sci J Moldova"},{"key":"556_CR46","doi-asserted-by":"crossref","unstructured":"Lamiche C, Bouchra D (2019) An efficient system for minimizing total weighted tardiness cost on single machine. In: 2019 International conference on digitization (ICD). IEEE, pp 57\u201359","DOI":"10.1109\/ICD47981.2019.9105730"},{"key":"556_CR47","doi-asserted-by":"crossref","unstructured":"Poongothai V, Godhandaraman P, Jenifer AA (2019) Single machine scheduling problem for minimizing total tardiness of a weighted jobs in a batch delivery system, stochastic rework and reprocessing times. In: AIP conference proceedings, vol 2112. AIP Publishing LLC, pp 020132","DOI":"10.1063\/1.5112317"},{"issue":"4","key":"556_CR48","first-page":"494","volume":"33","author":"Y Harrath","year":"2019","unstructured":"Harrath Y, Mahjoub A, Kaabi J (2019) A multi-objective genetic algorithm to solve a single machine scheduling problem with setup-times. Int J Serv Oper Manag 33(4):494\u2013511","journal-title":"Int J Serv Oper Manag"},{"key":"556_CR49","doi-asserted-by":"publisher","first-page":"26","DOI":"10.20535\/kpi-sn.2019.5-6.178016","volume":"5\u20136","author":"VV Romanuke","year":"2019","unstructured":"Romanuke VV (2019) Accurate total weighted tardiness minimization in tight-tardy progressive single machine scheduling with preemptions by no idle periods. KPI Sci News 5\u20136:26\u201342","journal-title":"KPI Sci News"},{"key":"556_CR50","doi-asserted-by":"crossref","unstructured":"Abitz D, Hartmann T, Middendorf M (2020) A weighted population update rule for PACO applied to the single machine total weighted tardiness problem. arXiv:200408433","DOI":"10.1145\/3377930.3390182"},{"key":"556_CR51","doi-asserted-by":"publisher","unstructured":"Jun S, Lee S (2020) Learning dispatching rules for single machine scheduling with dynamic arrivals based on decision trees and feature construction. Int J Product Res 1\u201319. https:\/\/doi.org\/10.1080\/00207543.2020.1741716","DOI":"10.1080\/00207543.2020.1741716"},{"key":"556_CR52","doi-asserted-by":"publisher","unstructured":"Queiroga E, Pinheiro RG, Christ Q, Subramanian A, Pessoa AA (2020) Iterated local search for single machine total weighted tardiness batch scheduling. J Heuris 1\u201386. https:\/\/doi.org\/10.1007\/s10732-020-09461-x","DOI":"10.1007\/s10732-020-09461-x"},{"key":"556_CR53","doi-asserted-by":"publisher","first-page":"105094","DOI":"10.1016\/j.knosys.2019.105094","volume":"189","author":"SK Joshi","year":"2020","unstructured":"Joshi SK, Bansal JC (2020) Parameter tuning for meta-heuristics. Knowl Based Syst 189:105094","journal-title":"Knowl Based Syst"},{"key":"556_CR54","doi-asserted-by":"publisher","first-page":"2385","DOI":"10.1007\/s13369-019-03991-8","volume":"45","author":"A Gopal","year":"2020","unstructured":"Gopal A, Sultani MM, Bansal JC (2020) On stability analysis of particle swarm optimization algorithm. Arab J Sci Eng 45:2385\u20132394. https:\/\/doi.org\/10.1007\/s13369-019-03991-8","journal-title":"Arab J Sci Eng"},{"issue":"4","key":"556_CR55","doi-asserted-by":"publisher","first-page":"2899","DOI":"10.1007\/s13369-018-03713-6","volume":"44","author":"S Lalwani","year":"2019","unstructured":"Lalwani S, Sharma H, Satapathy SC, Deep K, Bansal JC (2019) A survey on parallel particle swarm optimization algorithms. Arab J Sci Eng 44(4):2899\u20132923","journal-title":"Arab J Sci Eng"},{"issue":"4","key":"556_CR56","doi-asserted-by":"publisher","first-page":"774","DOI":"10.1007\/s13198-017-0642-4","volume":"9","author":"P Bhambu","year":"2018","unstructured":"Bhambu P, Kumar S, Sharma K (2018) Self balanced particle swarm optimization. Int J Syst Assur Eng Manag 9(4):774\u2013783","journal-title":"Int J Syst Assur Eng Manag"},{"key":"556_CR57","doi-asserted-by":"crossref","unstructured":"Shi Y, Eberhart R (1998) A modified particle swarm optimizer. In: The 1998 IEEE international conference on evolutionary computation proceedings, 1998. IEEE world congress on computational intelligence. IEEE, pp 69\u201373","DOI":"10.1109\/ICEC.1998.699146"},{"issue":"1","key":"556_CR58","doi-asserted-by":"publisher","first-page":"e12330","DOI":"10.1111\/exsy.12330","volume":"36","author":"E \u00c7omak","year":"2019","unstructured":"\u00c7omak E (2019) A particle swarm optimizer with modified velocity update and adaptive diversity regulation. Expert Syst 36(1):e12330","journal-title":"Expert Syst"},{"issue":"4","key":"556_CR59","doi-asserted-by":"publisher","first-page":"847","DOI":"10.1016\/j.asej.2019.02.006","volume":"10","author":"C Wang","year":"2019","unstructured":"Wang C, Song W (2019) A modified particle swarm optimization algorithm based on velocity updating mechanism. Ain Shams Eng J 10(4):847\u2013866","journal-title":"Ain Shams Eng J"},{"key":"556_CR60","doi-asserted-by":"crossref","unstructured":"Rathore A, Sharma H (2017) Review on inertia weight strategies for particle swarm optimization. In: Proceedings of sixth international conference on soft computing for problem solving. Springer, Berlin, pp 76\u201386","DOI":"10.1007\/978-981-10-3325-4_9"},{"issue":"1","key":"556_CR61","doi-asserted-by":"publisher","first-page":"35","DOI":"10.26529\/cepsj.322","volume":"8","author":"V Grubelnik","year":"2018","unstructured":"Grubelnik V, Marhl M, Repnik R (2018) Determination of the size and depth of craters on the moon. Center Educ Policy Stud J 8(1):35\u201353","journal-title":"Center Educ Policy Stud J"},{"key":"556_CR62","unstructured":"Smith R (2015) Moon phases explained. https:\/\/www.absolutesoulsecrets.com\/supermoon\/moon-phases-explained\/. Retrieved 10 May 2020"},{"key":"556_CR63","unstructured":"Gwern (2013) Lunar circadian rhythms. https:\/\/www.gwern.net\/Lunar-sleep. Retrieved 10 May 2020"},{"issue":"5","key":"556_CR64","doi-asserted-by":"publisher","first-page":"1573","DOI":"10.1109\/TCBB.2019.2897302","volume":"17","author":"N Sharma","year":"2019","unstructured":"Sharma N, Sharma H, Sharma A (2019) An effective solution for large scale single machine total weighted tardiness problem using lunar cycle inspired artificial bee colony algorithm. IEEE\/ACM Trans Comput Biol Bioinf 17(5):1573\u20131581. https:\/\/doi.org\/10.1109\/TCBB.2019.2897302","journal-title":"IEEE\/ACM Trans Comput Biol Bioinf"}],"container-title":["Evolutionary Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-020-00556-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12065-020-00556-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-020-00556-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,23]],"date-time":"2024-08-23T03:25:38Z","timestamp":1724383538000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12065-020-00556-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,28]]},"references-count":64,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["556"],"URL":"https:\/\/doi.org\/10.1007\/s12065-020-00556-9","relation":{},"ISSN":["1864-5909","1864-5917"],"issn-type":[{"value":"1864-5909","type":"print"},{"value":"1864-5917","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,28]]},"assertion":[{"value":"17 May 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 December 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 December 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 January 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}