{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T11:56:10Z","timestamp":1772452570660,"version":"3.50.1"},"reference-count":25,"publisher":"SAGE Publications","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["WEB"],"published-print":{"date-parts":[[2022,5,17]]},"abstract":"<jats:p>Task scheduling problems are involved in various fields, such as personal travel planning, UAV group path planning, intelligent furniture task scheduling and so on. As most of these task scheduling problems are subject to constraints of time, space and resource, conflicts often arise. However, the existing methods are typically limited to specific areas or geared to meet one or two types of constraints. As a result, they are unable to solve all conflicts systematically. This paper proposes a Task Heterogeneous Information Network (THIN) to model scheduling tasks and constraints comprehensively. Then, by dynamically exploring and converting Task Heterogeneous Information Networks, a series of algorithms are designed to detect and resolve all types of conflicts. Finally, conflict-free task plans are produced as outputs. Experiments have been conducted on datasets of different sizes, and the results show that our methods are effective.<\/jats:p>","DOI":"10.3233\/web-210478","type":"journal-article","created":{"date-parts":[[2022,4,15]],"date-time":"2022-04-15T10:59:30Z","timestamp":1650020370000},"page":"21-35","source":"Crossref","is-referenced-by-count":1,"title":["Conflict detection in Task Heterogeneous Information Networks"],"prefix":"10.1177","volume":"20","author":[{"given":"Zhonghui","family":"Hu","sequence":"first","affiliation":[{"name":"Wuhan Digital Engineering Research Institute of China State Shipbuilding Corporation Limited, Wuhan, 430074, China"}]},{"given":"Rui","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Wuhan University of Technology, Wuhan, China"}]},{"given":"Xichang","family":"Li","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Wuhan University of Technology, Wuhan, China"}]},{"given":"Zhipei","family":"Yu","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Wuhan University of Technology, Wuhan, China"}]},{"given":"Xiaojie","family":"Li","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Wuhan University of Technology, Wuhan, China"}]},{"given":"Wenfeng","family":"Zhao","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Wuhan University of Technology, Wuhan, China"}]},{"given":"Xudong","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Wuhan University of Technology, Wuhan, China"}]},{"given":"Lin","family":"Li","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Wuhan University of Technology, Wuhan, China"}]}],"member":"179","reference":[{"key":"10.3233\/WEB-210478_ref1","doi-asserted-by":"crossref","unstructured":"A.\u00a0Ahmeti and N.\u00a0Musliu, Min-conflicts heuristic for multi-mode resource-constrained projects scheduling, in: GECCO, 2018, pp.\u00a0237\u2013244.","DOI":"10.1145\/3205455.3205620"},{"key":"10.3233\/WEB-210478_ref2","doi-asserted-by":"crossref","unstructured":"S.\u00a0Akmal, S.\u00a0Ammons, H.\u00a0Li et al., Quantifying degrees of controllability in temporal networks with uncertainty, in: ICAPS, 2019, pp.\u00a022\u201330.","DOI":"10.1609\/icaps.v29i1.3456"},{"key":"10.3233\/WEB-210478_ref3","doi-asserted-by":"publisher","first-page":"26177","DOI":"10.1109\/ACCESS.2021.3057366","article-title":"An immune genetic algorithm for solving NPV-based resource constrained project scheduling problem","volume":"9","author":"Asadujjaman","year":"2021","journal-title":"IEEE Access"},{"issue":"1","key":"10.3233\/WEB-210478_ref4","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s10115-019-01356-z","article-title":"Mutual clustering on comparative texts via heterogeneous information networks","volume":"62","author":"Cao","year":"2020","journal-title":"Knowledge and Information Systems"},{"key":"10.3233\/WEB-210478_ref5","doi-asserted-by":"crossref","unstructured":"F.\u00a0de\u00a0Nijs, M.T.J.\u00a0Spaan and M.M.\u00a0de\u00a0Weerdt, Preallocation and planning under stochastic resource constraints, in: AAAI, 2018, pp.\u00a04662\u20134669.","DOI":"10.1609\/aaai.v32i1.11592"},{"key":"10.3233\/WEB-210478_ref6","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0004-3702(91)90006-6","article-title":"Temporal constraint networks","volume":"49","author":"Dechter","year":"1991","journal-title":"Artificial Intelligence"},{"key":"10.3233\/WEB-210478_ref8","doi-asserted-by":"crossref","unstructured":"M.\u00a0Gao, L.\u00a0Popowski and J.\u00a0Boerkoel, Dynamic control of probabilistic simple temporal networks, in: AAAI, 2020, pp.\u00a09851\u20139858.","DOI":"10.1609\/aaai.v34i06.6538"},{"key":"10.3233\/WEB-210478_ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3358061"},{"key":"10.3233\/WEB-210478_ref10","unstructured":"J.\u00a0Hee Lee, S.\u00a0Li, Z.\u00a0Long et al., On redundancy in simple temporal networks, in: ECAI, 2016, pp.\u00a0828\u2013836."},{"key":"10.3233\/WEB-210478_ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271805"},{"key":"10.3233\/WEB-210478_ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330970"},{"key":"10.3233\/WEB-210478_ref13","doi-asserted-by":"crossref","unstructured":"T.\u00a0Huang, Z.\u00a0Zhuang, S.\u00a0Zhang et al., Homogenization with explicit semantics preservation for heterogeneous information network, in: Proceedings of the 29th ACM International Conference on Information & Knowledge Management, 2020, pp.\u00a02065\u20132068.","DOI":"10.1145\/3340531.3412135"},{"issue":"2","key":"10.3233\/WEB-210478_ref14","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s00236-015-0227-0","article-title":"Efficient execution of dynamically controllable simple temporal networks with uncertainty","volume":"53","author":"Hunsberger","year":"2016","journal-title":"Acta Informatica"},{"key":"10.3233\/WEB-210478_ref15","doi-asserted-by":"crossref","unstructured":"L.\u00a0Hunsberger and R.\u00a0Posenato, A new approach to checking the dynamic consistency of conditional simple temporal networks, in: CP, 2016, pp.\u00a0268\u2013286.","DOI":"10.1007\/978-3-319-44953-1_18"},{"issue":"4","key":"10.3233\/WEB-210478_ref16","doi-asserted-by":"crossref","first-page":"1041","DOI":"10.17762\/turcomat.v12i4.612","article-title":"Task scheduling algorithms in cloud computing: A review","volume":"12","author":"Ibrahim","year":"2021","journal-title":"Turkish Journal of Computer and Mathematics Education (TURCOMAT)"},{"key":"10.3233\/WEB-210478_ref17","doi-asserted-by":"crossref","unstructured":"T.K.S.\u00a0Kumar, Z.\u00a0Wang, A.\u00a0Kumar et al., Load scheduling of simple temporal networks under dynamic resource pricing, in: AAAI, 2018, pp.\u00a06227\u20136236.","DOI":"10.1609\/aaai.v32i1.12084"},{"issue":"2","key":"10.3233\/WEB-210478_ref18","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1142\/S2301385021500151","article-title":"A survey of motion and task planning techniques for unmanned multicopter systems","volume":"9","author":"Lan","year":"2021","journal-title":"Unmanned Syst."},{"key":"10.3233\/WEB-210478_ref19","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.tcs.2021.01.013","article-title":"Measuring diversity in heterogeneous information networks","volume":"859","author":"Morales","year":"2021","journal-title":"Theoretical Computer Science"},{"issue":"8","key":"10.3233\/WEB-210478_ref20","doi-asserted-by":"publisher","first-page":"2055015:1","DOI":"10.1142\/S0218001420550150","article-title":"Human-vehicle collision detection algorithm based on image processing","volume":"34","author":"Qu","year":"2020","journal-title":"Int. J. Pattern Recognit. Artif. Intell."},{"issue":"4","key":"10.3233\/WEB-210478_ref21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3333028","article-title":"Continuous-time relationship prediction in dynamic heterogeneous information networks","volume":"13","author":"Sajadmanesh","year":"2019","journal-title":"ACM Transactions on Knowledge Discovery from Data (TKDD)"},{"issue":"2","key":"10.3233\/WEB-210478_ref22","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1109\/TKDE.2018.2833443","article-title":"Heterogeneous information network embedding for recommendation","volume":"31","author":"Shi","year":"2018","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"10.3233\/WEB-210478_ref23","unstructured":"X.\u00a0Wang, Z.\u00a0Ning, S.\u00a0Guo et al., Imitation learning enabled task scheduling for online vehicular edge computing, in: IEEE Transactions on Mobile Computing, 2020."},{"issue":"7","key":"10.3233\/WEB-210478_ref24","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1080\/17517575.2014.986215","article-title":"Resource conflict detection and removal strategy for nondeterministic emergency response processes using Petri nets","volume":"10","author":"Zeng","year":"2016","journal-title":"Enterp. Inf. Syst."},{"key":"10.3233\/WEB-210478_ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.micpro.2020.103282"},{"key":"10.3233\/WEB-210478_ref27","doi-asserted-by":"publisher","first-page":"16630","DOI":"10.1109\/ACCESS.2021.3053302","article-title":"Fast collision detection for small unmanned aircraft systems in urban airspace","volume":"9","author":"Zou","year":"2021","journal-title":"IEEE Access"}],"container-title":["Web Intelligence"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/WEB-210478","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T10:59:41Z","timestamp":1772449181000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/WEB-210478"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,17]]},"references-count":25,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.3233\/web-210478","relation":{},"ISSN":["2405-6464","2405-6456"],"issn-type":[{"value":"2405-6464","type":"electronic"},{"value":"2405-6456","type":"print"}],"subject":[],"published":{"date-parts":[[2022,5,17]]}}}