{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,23]],"date-time":"2026-05-23T00:07:50Z","timestamp":1779494870032,"version":"3.53.1"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031039478","type":"print"},{"value":"9783031039485","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-03948-5_15","type":"book-chapter","created":{"date-parts":[[2022,5,23]],"date-time":"2022-05-23T10:07:17Z","timestamp":1653300437000},"page":"173-184","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Resource Scheduling for\u00a0Human-Machine Collaboration in\u00a0Multiagent Systems"],"prefix":"10.1007","author":[{"given":"Yifeng","family":"Zhou","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kai","family":"Di","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zichen","family":"Dong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yichuan","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,4,25]]},"reference":[{"key":"15_CR1","unstructured":"PSPLIB. http:\/\/www.om-db.wi.tum.de\/psplib\/main.html"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Abrishami, S., Naghibzadeh, M., Epema, D.H.: Deadline-constrained workflow scheduling algorithms for infrastructure as a service clouds. Fut. Gener. Comput. Syst. 29(1), 158\u2013169 (2013)","DOI":"10.1016\/j.future.2012.05.004"},{"issue":"1","key":"15_CR3","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1109\/TRO.2018.2875389","volume":"35","author":"H Cai","year":"2018","unstructured":"Cai, H., Mostofi, Y.: Human-robot collaborative site inspection under resource constraints. IEEE Trans. Rob. 35(1), 200\u2013215 (2018)","journal-title":"IEEE Trans. Rob."},{"issue":"2","key":"15_CR4","first-page":"55","volume":"3","author":"F Habibi","year":"2018","unstructured":"Habibi, F., Barzinpour, F., Sadjadi, S.: Resource-constrained project scheduling problem: review of past and recent developments. J. Proj. Manage. 3(2), 55\u201388 (2018)","journal-title":"J. Proj. Manage."},{"issue":"1","key":"15_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2700327","volume":"10","author":"Y Jiang","year":"2015","unstructured":"Jiang, Y., Zhou, Y., Li, Y.: Reliable task allocation with load balancing in multiplex networks. ACM Trans. Auton. Adapt. Syst. (TAAS) 10(1), 1\u201332 (2015)","journal-title":"ACM Trans. Auton. Adapt. Syst. (TAAS)"},{"issue":"8","key":"15_CR6","doi-asserted-by":"publisher","first-page":"1671","DOI":"10.1109\/TPDS.2012.249","volume":"24","author":"Y Jiang","year":"2012","unstructured":"Jiang, Y., Zhou, Y., Wang, W.: Task allocation for undependable multiagent systems in social networks. IEEE Trans. Parallel Distrib. Syst. 24(8), 1671\u20131681 (2012)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"3","key":"15_CR7","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1016\/0196-6774(85)90012-4","volume":"6","author":"DS Johnson","year":"1985","unstructured":"Johnson, D.S.: The NP-completeness column: an ongoing guide. J. Algorithms 6(3), 434\u2013451 (1985)","journal-title":"J. Algorithms"},{"issue":"3","key":"15_CR8","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1109\/TNSM.2016.2554143","volume":"13","author":"B Lin","year":"2016","unstructured":"Lin, B., Guo, W., Xiong, N., Chen, G., Vasilakos, A.V., Zhang, H.: A pretreatment workflow scheduling approach for big data applications in multicloud environments. IEEE Trans. Netw. Serv. Manage. 13(3), 581\u2013594 (2016)","journal-title":"IEEE Trans. Netw. Serv. Manage."},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Lin, J., Zhu, L., Gao, K.: A genetic programming hyper-heuristic approach for the multi-skill resource constrained project scheduling problem. Exp. Syst. Appl. 140, 112915 (2020)","DOI":"10.1016\/j.eswa.2019.112915"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Rezaei, F., Najafi, A.A., Ramezanian, R.: Mean-conditional value at risk model for the stochastic project scheduling problem. Comput. Ind. Eng. 142, 106356 (2020)","DOI":"10.1016\/j.cie.2020.106356"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Sprecher, A., Kolisch, R.: PSPLIB - a project scheduling problem library. Eur. J. Oper. Res. 96, 205\u2013216 (1996)","DOI":"10.1016\/S0377-2217(96)00170-1"},{"issue":"6","key":"15_CR12","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/s00607-018-00693-1","volume":"101","author":"EB Tirkolaee","year":"2019","unstructured":"Tirkolaee, E.B., Goli, A., Hematian, M., Sangaiah, A.K., Han, T.: Multi-objective multi-mode resource constrained project scheduling problem using pareto-based algorithms. Computing 101(6), 547\u2013570 (2019)","journal-title":"Computing"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Wu, B., Hu, B., Lin, H.: Toward efficient manufacturing systems: a trust based human robot collaboration. In: 2017 American Control Conference (ACC), pp. 1536\u20131541. IEEE (2017)","DOI":"10.23919\/ACC.2017.7963171"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Zhou, Y., Di, K., Xing, H.: Hybrid multiagent collaboration for time-critical tasks: a mathematical model and heuristic approach. Algorithms 14(11), 327 (2021)","DOI":"10.3390\/a14110327"}],"container-title":["IFIP Advances in Information and Communication Technology","Intelligent Information Processing XI"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-03948-5_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,23]],"date-time":"2026-05-23T00:04:10Z","timestamp":1779494650000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-03948-5_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031039478","9783031039485"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-03948-5_15","relation":{},"ISSN":["1868-4238","1868-422X"],"issn-type":[{"value":"1868-4238","type":"print"},{"value":"1868-422X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"25 April 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IIP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Information Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Qingdao","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 May 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 May 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iip2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.intsci.ac.cn\/iip2022","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 reviews per paper","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"56","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"66% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}