{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T02:07:51Z","timestamp":1740103671198,"version":"3.37.3"},"reference-count":36,"publisher":"Wiley","license":[{"start":{"date-parts":[[2020,12,29]],"date-time":"2020-12-29T00:00:00Z","timestamp":1609200000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["318689"],"award-info":[{"award-number":["318689"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2020,12,29]]},"abstract":"<jats:p>This paper delves into a two-agent scheduling problem in which two agents are competing for a single resource. Each agent has a set of jobs to be processed by a single machine. The processing time, release time, weight, and the due dates of each job are known in advance. Both agents have their objectives, which are conflicting in nature. The first agent tries to minimize the total completion time, while the second agent tries to minimize the number of tardy jobs. The two agents\u2019 scheduling problem, an NP-hard problem, has a wide variety of applications ranging from the manufacturing industry to the cloud computing service provider. Due to the wide applicability, each variation of the problem requires a different algorithm, adapted according to the user\u2019s requirements. This paper provides mathematical models, heuristic algorithms, and two nature-based metaheuristic algorithms to solve the problem. The algorithm\u2019s performance was gauged against the optimal solution obtained from the AMPL-CPLEX solver for both solution quality and computational time. The outlined metaheuristics produce a solution that is comparable with a short computational time. The proposed metaheuristics even have a better solution than the CPLEX solver for medium-size problems, whereas the computation times are much less than the CPLEX solvers.<\/jats:p>","DOI":"10.1155\/2020\/1385049","type":"journal-article","created":{"date-parts":[[2020,12,30]],"date-time":"2020-12-30T02:20:08Z","timestamp":1609294808000},"page":"1-13","source":"Crossref","is-referenced-by-count":1,"title":["Nature-Inspired Metaheuristics for Two-Agent Scheduling with Due Date and Release Time"],"prefix":"10.1155","volume":"2020","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6072-2935","authenticated-orcid":true,"given":"Hongwei","family":"Li","sequence":"first","affiliation":[{"name":"Department of Supply Chain Management, I.H. Asper School of Business, University of Manitoba, Winnipeg R3T 5V4, Manitoba, Canada"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7105-8926","authenticated-orcid":true,"given":"Yuvraj","family":"Gajpal","sequence":"additional","affiliation":[{"name":"Department of Supply Chain Management, I.H. Asper School of Business, University of Manitoba, Winnipeg R3T 5V4, Manitoba, Canada"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9080-9732","authenticated-orcid":true,"given":"Chirag","family":"Surti","sequence":"additional","affiliation":[{"name":"Department of Information System, Analytics and Supply Chain Management College of Business, Rider University, 2 083 Lawrenceville Rd, Lawrenceville 08648, NJ, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2865-0430","authenticated-orcid":true,"given":"Dongliang","family":"Cai","sequence":"additional","affiliation":[{"name":"School of Finance, Southwestern University of Finance and Economics, Chengdu 610000, Sichuan, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0713-8016","authenticated-orcid":true,"given":"Amit Kumar","family":"Bhardwaj","sequence":"additional","affiliation":[{"name":"L.M. Thapar School of Management, Thapar Institute of Engineering & Technology, Dera Bassi Campus, Patiala, Punjab, India"}]}],"member":"311","reference":[{"issue":"12","key":"1","doi-asserted-by":"crossref","first-page":"2438","DOI":"10.1109\/TSMC.2018.2847448","article-title":"Target disassembly sequencing and scheme evaluation for CNC machine tools using improved multi-objective ant colony algorithm and fuzzy integral","volume":"49","author":"Y. Feng","year":"2018","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics: Systems"},{"issue":"1","key":"2","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1109\/TASE.2018.2840348","article-title":"Flexible process planning and end-of-life decision-making for product recovery optimization based on hybrid disassembly","volume":"16","author":"Y. Feng","year":"2018","journal-title":"IEEE Transactions on Automation Science and Engineering"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/jas.2019.1911411"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1023\/a:1022231419049"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2009.06.105"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/jas.2019.1911540"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1002\/spe.2890"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2007.06.017"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1016\/0167-7187(96)01014-4"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(94)00090-u"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1030.0092"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1016\/0360-8352(95)00028-3"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2007.04.040"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2014.09.028"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-006-9001-0"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1090.0744"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1016\/j.apm.2010.01.015"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1504\/ijstl.2013.050590"},{"key":"19","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-016-0078-9"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1002\/nav.21700"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2015.10.059"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-016-0049-1"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1057\/jors.2013.9"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2014.11.024"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1177\/1687814018756103"},{"issue":"5","key":"26","first-page":"1","article-title":"A survey of due-date related single-machine with two-agent scheduling problem","volume":"13","author":"H. Li","year":"2019","journal-title":"Journal of Industrial & Management Optimization"},{"key":"27","doi-asserted-by":"crossref","DOI":"10.1007\/978-981-15-2105-8","volume-title":"Due Date-Related Scheduling with Two Agents","author":"Y. Yin","year":"2020"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-018-0583-z"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-018-0598-5"},{"issue":"7","key":"30","doi-asserted-by":"crossref","first-page":"2523","DOI":"10.1109\/TITS.2018.2867577","article-title":"A dual-colony ant algorithm for the receiving and shipping door assignments in cross-docks","volume":"20","author":"Y. H. Zhang","year":"2018","journal-title":"IEEE Transactions on Intelligent Transportation Systems"},{"issue":"2","key":"31","doi-asserted-by":"crossref","first-page":"909","DOI":"10.1109\/TASE.2019.2950964","article-title":"Multi-objective bike repositioning in bike-sharing systems via a modified artificial bee colony algorithm","volume":"17","author":"H. Jia","year":"2019","journal-title":"IEEE Transactions on Automation Science and Engineering"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2018.05.027"},{"first-page":"3226","article-title":"Problem solving by intelligent water drops","author":"H. S. Hosseini","key":"33"},{"key":"34","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2014.05.010"},{"article-title":"Ant colony optimization: a new meta-heuristic","author":"M. Dorigo","key":"35","doi-asserted-by":"crossref","DOI":"10.1109\/CEC.1999.782657"},{"issue":"4","key":"36","first-page":"1659","article-title":"Enhanced ant colony system based on the RASA algorithm in grid scheduling","volume":"2","author":"D. Maruthanayagam","year":"2011","journal-title":"IJCSIT) International Journal of Computer Science and Information Technologies"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2020\/1385049.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2020\/1385049.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2020\/1385049.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,30]],"date-time":"2020-12-30T02:20:17Z","timestamp":1609294817000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/complexity\/2020\/1385049\/"}},"subtitle":[],"editor":[{"given":"Wei","family":"Zhou","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2020,12,29]]},"references-count":36,"alternative-id":["1385049","1385049"],"URL":"https:\/\/doi.org\/10.1155\/2020\/1385049","relation":{},"ISSN":["1099-0526","1076-2787"],"issn-type":[{"type":"electronic","value":"1099-0526"},{"type":"print","value":"1076-2787"}],"subject":[],"published":{"date-parts":[[2020,12,29]]}}}