{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T18:40:54Z","timestamp":1775068854321,"version":"3.50.1"},"reference-count":53,"publisher":"Informa UK Limited","issue":"10","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71871118"],"award-info":[{"award-number":["71871118"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012154","name":"Postgraduate Research & Practice Innovation Program of Jiangsu Province","doi-asserted-by":"publisher","award":["KYCX20_0348"],"award-info":[{"award-number":["KYCX20_0348"]}],"id":[{"id":"10.13039\/501100012154","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Production Research"],"published-print":{"date-parts":[[2025,5,19]]},"DOI":"10.1080\/00207543.2024.2431178","type":"journal-article","created":{"date-parts":[[2024,11,28]],"date-time":"2024-11-28T19:44:26Z","timestamp":1732823066000},"page":"3822-3853","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":1,"title":["A multi-objective artificial bee colony algorithm for single machine scheduling with family setup under TOU tariffs"],"prefix":"10.1080","volume":"63","author":[{"given":"Ling","family":"Xue","sequence":"first","affiliation":[{"name":"Nanjing University of Science and Technology","place":["Nanjing, People\u2019s Republic of China"]}]},{"given":"Xiuli","family":"Wang","sequence":"additional","affiliation":[{"name":"Nanjing University of Science and Technology","place":["Nanjing, People\u2019s Republic of China"]}]}],"member":"301","published-online":{"date-parts":[[2024,11,28]]},"reference":[{"key":"e_1_3_3_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2010.04.001"},{"key":"e_1_3_3_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2017.04.026"},{"key":"e_1_3_3_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10710-005-6164-x"},{"key":"e_1_3_3_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(95)00349-5"},{"key":"e_1_3_3_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2023.3336659"},{"key":"e_1_3_3_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.996017"},{"key":"e_1_3_3_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31880-4_5"},{"key":"e_1_3_3_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-015-2003-5"},{"key":"e_1_3_3_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2021.06.012"},{"key":"e_1_3_3_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2015.07.017"},{"key":"e_1_3_3_12_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2021.1951446"},{"key":"e_1_3_3_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s40747-019-00122-6"},{"key":"e_1_3_3_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-015-0440-2"},{"key":"e_1_3_3_15_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2019.1653504"},{"key":"e_1_3_3_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2015.07.001"},{"key":"e_1_3_3_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2008.08.001"},{"key":"e_1_3_3_18_1","unstructured":"Karaboga D. 2005. \u201cAn Idea Based on Honey Bee Swarm for Numerical Optimization.\u201d Technical Report-TR06 Erciyes University Engineering Faculty Computer Engineering Department."},{"key":"e_1_3_3_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-007-9149-x"},{"key":"e_1_3_3_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.117577"},{"key":"e_1_3_3_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106544"},{"key":"e_1_3_3_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.108115"},{"key":"e_1_3_3_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-015-1824-6"},{"key":"e_1_3_3_24_1","volume-title":"Scheduling: Theory, Algorithms, and Systems","author":"Pinedo M.","year":"2001","unstructured":"Pinedo, M. 2001. Scheduling: Theory, Algorithms, and Systems. 2nd ed. New York: Springer.","edition":"2"},{"key":"e_1_3_3_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2016.09.030"},{"key":"e_1_3_3_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/SCCC.2012.24"},{"key":"e_1_3_3_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEM.2018.2846627"},{"key":"e_1_3_3_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2011.12.014"},{"key":"e_1_3_3_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2020.3013290"},{"key":"e_1_3_3_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2014.10.010"},{"key":"e_1_3_3_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2012.03.010"},{"key":"e_1_3_3_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.seps.2022.101300"},{"key":"e_1_3_3_33_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207549508904839"},{"key":"e_1_3_3_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.108725"},{"key":"e_1_3_3_35_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2023.2279145"},{"key":"e_1_3_3_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2012.06.003"},{"key":"e_1_3_3_37_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2024.2333943"},{"key":"e_1_3_3_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2019.102117"},{"key":"e_1_3_3_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-019-03494-7"},{"key":"e_1_3_3_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2020.10.052"},{"key":"e_1_3_3_41_1","doi-asserted-by":"publisher","DOI":"10.4028\/www.scientific.net\/AMR.383-390.6236"},{"key":"e_1_3_3_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2023.110029"},{"key":"e_1_3_3_43_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2018.12.065"},{"key":"e_1_3_3_44_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106431"},{"key":"e_1_3_3_45_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2016.10.026"},{"key":"e_1_3_3_46_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.123011"},{"key":"e_1_3_3_47_1","doi-asserted-by":"publisher","DOI":"10.1080\/0305215X.2017.1400026"},{"key":"e_1_3_3_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2007.892759"},{"key":"e_1_3_3_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/JAS.2020.1003539"},{"key":"e_1_3_3_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2019.2953669"},{"key":"e_1_3_3_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2020.3027532"},{"key":"e_1_3_3_52_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2023.109428"},{"key":"e_1_3_3_53_1","article-title":"\u201cSPEA2: Improving the Strength Pareto Evolutionary Algorithm.\u201d Computer Engineering and Networks Laboratory (TIK), Swiss Federal Institute of Technology (ETH), Zurich, Switzerland","volume":"103","author":"Zitzler E.","year":"2001","unstructured":"Zitzler, E., M. Laumanns, and L. Thiele. 2001. \u201c\u201cSPEA2: Improving the Strength Pareto Evolutionary Algorithm.\u201d Computer Engineering and Networks Laboratory (TIK), Swiss Federal Institute of Technology (ETH), Zurich, Switzerland.\u201d TIK-Report 103.","journal-title":"TIK-Report"},{"key":"e_1_3_3_54_1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.797969"}],"container-title":["International Journal of Production Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/00207543.2024.2431178","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T00:06:14Z","timestamp":1748390774000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/00207543.2024.2431178"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,28]]},"references-count":53,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2025,5,19]]}},"alternative-id":["10.1080\/00207543.2024.2431178"],"URL":"https:\/\/doi.org\/10.1080\/00207543.2024.2431178","relation":{},"ISSN":["0020-7543","1366-588X"],"issn-type":[{"value":"0020-7543","type":"print"},{"value":"1366-588X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,28]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=tprs20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=tprs20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2023-12-11","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-11-06","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-11-28","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}