{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T14:33:13Z","timestamp":1771338793851,"version":"3.50.1"},"reference-count":31,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2022]]},"DOI":"10.1109\/access.2022.3174484","type":"journal-article","created":{"date-parts":[[2022,5,12]],"date-time":"2022-05-12T19:33:35Z","timestamp":1652384015000},"page":"52126-52138","source":"Crossref","is-referenced-by-count":9,"title":["A Discrete Chimp Optimization Algorithm for Minimizing Tardy\/Lost Penalties on a Single Machine Scheduling Problem"],"prefix":"10.1109","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4448-0363","authenticated-orcid":false,"given":"Riham","family":"Moharam","sequence":"first","affiliation":[{"name":"Department of Mathematics, Faculty of Science, Suez Canal University, Ismailia, Egypt"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1479-7148","authenticated-orcid":false,"given":"Ahmed F.","family":"Ali","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Faculty of Computers and Informatics, Suez Canal University, Ismailia, Egypt"}]},{"given":"Ehab","family":"Morsy","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Faculty of Science, Suez Canal University, Ismailia, Egypt"}]},{"given":"Mohamed Ali","family":"Ahmed","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Faculty of Science, Suez Canal University, Ismailia, Egypt"}]},{"given":"Mostafa-Sami M.","family":"Mostafa","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Faculty of Computers and Information, Helwan University, Cairo, Egypt"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.compstruc.2016.03.001"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1002\/nav.21869"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2004.04.013"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-021-00714-4"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2011.06.006"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1080\/07408179008964176"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(94)90069-8"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1134\/S0005117920050069"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/1090.001.0001"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02882-3_24"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(93)90181-L"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.08.030"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICNN.1995.488968"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/S0360-8352(02)00123-7"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113338"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2013.02.026"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s40314-016-0370-4"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.11.039"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2009.04.007"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70743-X"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2013.12.007"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(92)90001-J"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1287\/opre.40.3.586"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICIEA52957.2021.9436746"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2010.06.006"},{"key":"ref26","first-page":"332","article-title":"Schedule optimization using genetic algorithms","volume-title":"Handbook of Genetic Algorithms","author":"Syswerda","year":"2008"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-015-1590-z"},{"key":"ref28","first-page":"328","article-title":"The NP-hardness of the single machine common due date weighted tardiness problem","volume":"5","author":"Yuan","year":"1992","journal-title":"Syst. Sci. Math. Sci."},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2019.2953669"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2020.3027532"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/JAS.2020.1003539"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9668973\/09773298.pdf?arnumber=9773298","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,22]],"date-time":"2024-01-22T22:46:56Z","timestamp":1705963616000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9773298\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/access.2022.3174484","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]}}}