{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:11:57Z","timestamp":1743073917079,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":20,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789811945489"},{"type":"electronic","value":"9789811945496"}],"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.springer.com\/tdm"},{"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.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-981-19-4549-6_4","type":"book-chapter","created":{"date-parts":[[2022,7,21]],"date-time":"2022-07-21T20:17:11Z","timestamp":1658434631000},"page":"37-51","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Multi-objective Optimization of\u00a0Ticket Assignment Problem in\u00a0Large Data Centers"],"prefix":"10.1007","author":[{"given":"Tariq Ali","family":"Arain","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiangjie","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhicheng","family":"Cai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,7,22]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Alemzadeh, S., Dastghaibyfard, G.: Time and cost trade-off using multi-objective task scheduling in utility grids. In: ICCKE 2013, pp. 362\u2013367. IEEE (2013)","DOI":"10.1109\/ICCKE.2013.6682856"},{"issue":"2","key":"4_CR2","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1006\/jpdc.1999.1581","volume":"59","author":"M Maheswaran","year":"1999","unstructured":"Maheswaran, M., Ali, S., Siegel, H.J., Hensgen, D., Freund, R.F.: Dynamic mapping of a class of independent tasks onto heterogeneous computing systems. J. Parallel Distrib. Comput. 59(2), 107\u2013131 (1999)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"5","key":"4_CR3","first-page":"54","volume":"9","author":"L Zhu","year":"2012","unstructured":"Zhu, L., Li, Q., He, L.: Study on cloud computing resource scheduling strategy based on the ant colony optimization algorithm. Int. J. Comput. Sci. Issues (IJCSI) 9(5), 54 (2012)","journal-title":"Int. J. Comput. Sci. Issues (IJCSI)"},{"issue":"2","key":"4_CR4","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1162\/evco.2008.16.2.225","volume":"16","author":"M Gong","year":"2008","unstructured":"Gong, M., Jiao, L., Du, H., Bo, L.: Multiobjective immune algorithm with nondominated neighbor-based selection. Evol. Comput. 16(2), 225\u2013255 (2008)","journal-title":"Evol. Comput."},{"issue":"7","key":"4_CR5","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1080\/095372899232777","volume":"10","author":"K Chakravarthy","year":"1999","unstructured":"Chakravarthy, K., Rajendran, C.: A heuristic for scheduling in a flowshop with the bicriteria of makespan and maximum tardiness minimization. Prod. Plan. Control 10(7), 707\u2013714 (1999)","journal-title":"Prod. Plan. Control"},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"3056","DOI":"10.1016\/j.proeng.2012.06.356","volume":"38","author":"G Vidya","year":"2012","unstructured":"Vidya, G., Sarathambekai, S., Umamaheswari, K., Yamunadevi, S.: Task scheduling using adaptive weighted particle swarm optimization with adaptive weighted sum. Procedia Eng. 38, 3056\u20133063 (2012)","journal-title":"Procedia Eng."},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Agarwal, S., Sindhgatta, R., Sengupta, B.: SmartDispatch: enabling efficient ticket dispatch in an it service environment. In: Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1393\u20131401 (2012)","DOI":"10.1145\/2339530.2339744"},{"issue":"2","key":"4_CR8","doi-asserted-by":"publisher","first-page":"1436","DOI":"10.14778\/1454159.1454193","volume":"1","author":"Q Shao","year":"2008","unstructured":"Shao, Q., Chen, Y., Tao, S., Yan, X., Anerousis, N.: EasyTicket: a ticket routing recommendation engine for enterprise problem resolution. Proc. VLDB Endow. 1(2), 1436\u20131439 (2008)","journal-title":"Proc. VLDB Endow."},{"key":"4_CR9","doi-asserted-by":"publisher","unstructured":"Sun, P., Tao, S., Yan, X., Anerousis, N., Chen, Y.: Content-aware resolution sequence mining for ticket routing. In: International Conference on Business Process Management, pp. 243\u2013259. Springer, Cham (2010). https:\/\/doi.org\/10.1007\/978-3-642-15618-2_18","DOI":"10.1007\/978-3-642-15618-2_18"},{"issue":"9","key":"4_CR10","first-page":"1","volume":"6","author":"H Izakian","year":"2010","unstructured":"Izakian, H., Ladani, B.T., Abraham, A., Snasel, V., et al.: A discrete particle swarm optimization approach for grid job scheduling. Int. J. Innov. Comput. Inf. Control 6(9), 1\u201315 (2010)","journal-title":"Int. J. Innov. Comput. Inf. Control"},{"issue":"4","key":"4_CR11","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1111\/coin.12113","volume":"33","author":"S Sarathambekai","year":"2017","unstructured":"Sarathambekai, S., Umamaheswari, K.: Task scheduling in distributed systems using heap intelligent discrete particle swarm optimization. Comput. Intell. 33(4), 737\u2013770 (2017)","journal-title":"Comput. Intell."},{"issue":"1","key":"4_CR12","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1177\/1748301816665521","volume":"11","author":"S Sarathambekai","year":"2017","unstructured":"Sarathambekai, S., Umamaheswari, K.: Intelligent discrete particle swarm optimization for multiprocessor task scheduling problem. J. Algorithms Comput. Technol. 11(1), 58\u201367 (2017)","journal-title":"J. Algorithms Comput. Technol."},{"issue":"2","key":"4_CR13","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1093\/comjnl\/bxx059","volume":"61","author":"S Sarathambekai","year":"2017","unstructured":"Sarathambekai, S., Umamaheswari, K.: Multi-objective optimization techniques for task scheduling problem in distributed systems. Comput. J. 61(2), 248\u2013263 (2017)","journal-title":"Comput. J."},{"issue":"4","key":"4_CR14","doi-asserted-by":"publisher","first-page":"93","DOI":"10.14257\/ijgdc.2014.7.4.09","volume":"7","author":"M Karimi","year":"2014","unstructured":"Karimi, M.: Hybrid discrete particle swarm optimization for task scheduling in grid computing. Int. J. Grid Distrib. Comput. 7(4), 93\u2013104 (2014)","journal-title":"Int. J. Grid Distrib. Comput."},{"issue":"1","key":"4_CR15","first-page":"1","volume":"3","author":"G Subashini","year":"2011","unstructured":"Subashini, G., Bhuvaneswari, M.: Non-dominated particle swarm optimization for scheduling independent tasks on heterogeneous distributed environments. Int. J. Adv. Soft Comput. Appl. 3(1), 1\u201317 (2011)","journal-title":"Int. J. Adv. Soft Comput. Appl."},{"issue":"6","key":"4_CR16","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1007\/s12046-012-0102-4","volume":"37","author":"G Subashini","year":"2012","unstructured":"Subashini, G., Bhuvaneswari, M.C.: Comparison of multi-objective evolutionary approaches for task scheduling in distributed computing systems. Sadhana 37(6), 675\u2013694 (2012). https:\/\/doi.org\/10.1007\/s12046-012-0102-4","journal-title":"Sadhana"},{"key":"4_CR17","doi-asserted-by":"publisher","first-page":"3808","DOI":"10.1016\/j.proeng.2012.01.575","volume":"29","author":"S Kardani-Moghaddam","year":"2012","unstructured":"Kardani-Moghaddam, S., Khodadadi, F., Entezari-Maleki, R., Movaghar, A.: A hybrid genetic algorithm and variable neighborhood search for task scheduling problem in grid environment. Procedia Eng. 29, 3808\u20133814 (2012)","journal-title":"Procedia Eng."},{"key":"4_CR18","doi-asserted-by":"publisher","unstructured":"Abraham, A., Liu, H., Grosan, C., Xhafa, F.: Nature inspired meta-heuristics for grid scheduling: single and multi-objective optimization approaches. In: Metaheuristics for Scheduling in Distributed Computing Environments, pp. 247\u2013272. Springer, Cham (2008). https:\/\/doi.org\/10.1007\/978-3-540-69277-5_9","DOI":"10.1007\/978-3-540-69277-5_9"},{"issue":"2","key":"4_CR19","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1080\/19393555.2017.1407848","volume":"27","author":"K Pradeep","year":"2018","unstructured":"Pradeep, K., Jacob, T.P.: CGSA scheduler: a multi-objective-based hybrid approach for task scheduling in cloud environment. Inf. Secur. J. Glob. Perspect. 27(2), 77\u201391 (2018)","journal-title":"Inf. Secur. J. Glob. Perspect."},{"key":"4_CR20","unstructured":"Mandow, L., P\u00e9rez-de-la Cruz, J.-L.: A new approach to multiobjective A* search, pp. 218\u2013223 (2005)"}],"container-title":["Communications in Computer and Information Science","Computer Supported Cooperative Work and Social Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-19-4549-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,21]],"date-time":"2022-07-21T20:17:36Z","timestamp":1658434656000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-19-4549-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9789811945489","9789811945496"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-981-19-4549-6_4","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"22 July 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ChineseCSCW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"CCF Conference on Computer Supported Cooperative Work  and Social Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Xiangtan","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"chinesecscw2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.scholat.com\/home\/ccscw\/2021","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}