{"type":"ScholarlyArticle","title":"Online Task Assignment with Controllable Processing Time","authors":[{"name":"Ruoyu Wu","slug":"ruoyu-wu","given":"Ruoyu","family":"Wu","affiliation":"School of Computer Science , The University of Sydney"},{"name":"Wei Bao","slug":"wei-bao","given":"Wei","family":"Bao","affiliation":"School of Computer Science , The University of Sydney"},{"name":"Liming Ge","slug":"liming-ge","given":"Liming","family":"Ge","affiliation":"School of Computer Science , The University of Sydney"}],"abstract":"We study a new online assignment problem, called the Online Task Assignment with Controllable Processing Time. In a bipartite graph,  a set of online vertices (tasks) should be assigned to a set of offline vertices (machines) under the known adversarial distribution (KAD) assumption. We are the first to study controllable processing time in this scenario: There are  multiple processing levels for each task and higher level brings larger utility but also larger processing delay.\r\nA machine can reject an assignment at the cost of a rejection penalty, taken from a pre-determined rejection budget. Different processing levels cause different penalties. We propose the Online Machine and Level Assignment  (OMLA) Algorithm to simultaneously assign an offline machine and a processing level to each online task. We prove that OMLA achieves 1/2-competitive ratio if each machine has unlimited rejection budget and Δ/(3Δ-1)- competitive ratio if each machine has an initial rejection budget up to Δ. Interestingly, the competitive ratios do not change under different settings on the controllable processing time and we can conclude that OMLA is \"insensitive\" to the controllable processing time.","doi":"10.24963/ijcai.2023/607","url":"https://ijcai.org/proceedings/2023/607","pdf":"https://ijcai.org/proceedings/2023/0607.pdf","markdown":"https://ijcai.org/proceedings/2023/607.md","bibtex":"https://ijcai.org/proceedings/2023/bibtex/607","volume":{"slug":"2023","title":"Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2023","url":"https://ijcai.org/proceedings/2023/","year":2023,"location":"Macao, SAR","dates":"19-25 August 2023","editors":"Edith Elkind","isbn":"978-1-956792-03-4","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2023"},"section":"Planning and Scheduling","track":"Main Track","number":607,"pages":{"first":5466,"last":5474},"keywords":["Planning and Scheduling: PS: Planning under uncertainty","Planning and Scheduling: PS: Scheduling"],"videos":[],"references":[{"position":1,"raw":"[Alaei et al., 1993] Saeed Alaei, MohammadTaghi Haji- aghayi, and Vahid Liaghat. Online prophet-inequality matching with applications to ad allocation. pages 18-35, 1993.","title":"Online prophet-inequality matching with applications to ad allocation","authors":"Saeed Alaei, Mohammadtaghi Hajiaghayi, Vahid Liaghat","year":"1993","venue":null,"doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Alidaee and Ahmadian, 1993] Bahram Alidaee and Ahmad Ahmadian. Two parallel machine sequencing problems in- volving controllable job processing times. European Jour- nal of Operational Research, 70(3):335-341, 1993.","title":"Bahram Alidaee and Ahmad Ahmadian. Two parallel machine sequencing problems involving controllable job processing times","authors":"Ahmadian Alidaee","year":"1993","venue":"European Journal of Operational Research","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Alonso-Mora et al., 2017] Javier Alonso-Mora, Samitha Samaranayake, Alex Wallar, Emilio Frazzoli, and Daniela Rus. On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment. Proceedings of the National Academy of Sciences, 114(3):462-467, 2017.","title":"On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment","authors":"Javier Alonso-Mora, Samitha Samaranayake, Alex Wallar, Emilio Frazzoli, Daniela Rus","year":"2017","venue":"Proceedings of the National Academy of Sciences","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Andani et al., 2021] I. Gusti Ayu Andani, Lissy La Paix Puello, and Karst Geurs. Modelling effects of changes in travel time and costs of toll road usage on choices for res- idential location, route and travel mode across population segments in the jakarta-bandung region, indonesia. Trans- portation Research Part A: Policy and Practice, 145:81- 102, 2021.","title":"Modelling effects of changes in travel time and costs of toll road usage on choices for residential location, route and travel mode across population segments in the jakarta-bandung region, indonesia","authors":"Andani","year":"2021","venue":"Transportation Research Part A: Policy and Practice","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Chen et al., 1997] Zhi-Long Chen, Qing Lu, and Guochun Tang. Single machine scheduling with discretely con- trollable processing times. Operations Research Letters, 21(2):69-76, 1997.","title":"Single machine scheduling with discretely controllable processing times","authors":"Zhi-Long Chen, Qing Lu, Guochun Tang","year":"1997","venue":"Operations Research Letters","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Cheng et al., 1996] T. C. E. Cheng, Z. L. Chen, and Chung- Lun Li. Parallel-machine scheduling with controllable processing times. IIE transactions, 28(2):177-180, 1996.","title":"Parallel-machine scheduling with controllable processing times","authors":"T C E Cheng, Z L Chen, Chung-Lun Li","year":"1996","venue":"IIE transactions","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Dickerson et al., 2021] John P. Dickerson, Karthik A. Sankararaman, Aravind Srinivasan, and Pan Xu. Alloca- tion problems in ride-sharing platforms: Online matching with offline reusable resources. ACM Transactions on Eco- nomics and Computation (TEAC), 9(3):1-17, 2021.","title":"Allocation problems in ride-sharing platforms: Online matching with offline reusable resources","authors":"John P Dickerson, Karthik A Sankararaman, Aravind Srinivasan, Pan Xu","year":"2021","venue":"ACM Transactions on Economics and Computation (TEAC)","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Dong et al., 2021] Zehao Dong, Sanmay Das, Patrick Fowler, and Chien-Ju Ho. Efficient nonmyopic online allo- cation of scarce reusable resources. In Proceedings of the 20th International Conference on Autonomous Agents and MultiAgent Systems, AAMAS '21, page 447-455, Rich- land, SC, 2021. International Foundation for Autonomous Agents and Multiagent Systems.","title":"Efficient nonmyopic online allocation of scarce reusable resources","authors":"Dong","year":"2021","venue":"Proceedings of the 20th International Conference on Autonomous Agents and MultiAgent Systems, AAMAS '21","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Goyal et al., 2020] Vineet Goyal, Garud Iyengar, and Ra- jan Udwani. Asymptotically optimal competitive ratio for online allocation of reusable resources. arXiv preprint arXiv:2002.02430, 2020.","title":"Asymptotically optimal competitive ratio for online allocation of reusable resources","authors":"Vineet Goyal, Garud Iyengar, Rajan Udwani","year":"2020","venue":null,"doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[He et al., 2007] Yong He, Qi Wei, and T. C. E. Cheng. Single-machine scheduling with trade-off between number of tardy jobs and compression cost. Journal of Scheduling, 10(4):303-310, 2007.","title":"Single-machine scheduling with trade-off between number of tardy jobs and compression cost","authors":"Yong He, Qi Wei, T C E Cheng","year":"2007","venue":"Journal of Scheduling","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Hikima et al., 2022] Yuya Hikima, Yasunori Akagi, Naoki Marumo, and Hideaki Kim. Online matching with con- trollable rewards and arrival probabilities. In Lud De Raedt, editor, Proceedings of the Thirty-First Interna- tional Joint Conference on Artificial Intelligence, IJCAI- 22, pages 1825-1833. International Joint Conferences on Artificial Intelligence Organization, 7 2022. Main Track. Hosseini et al., 2022]","title":"Online matching with controllable rewards and arrival probabilities","authors":"Yuya Hikima, Yasunori Akagi, Naoki Marumo, Hideaki Kim","year":"2022","venue":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI-22","doi":null,"url":null,"internal_url":"/proceedings/2022/254"},{"position":12,"raw":"Hadi Hosseini, Zhiyi Huang, Ayumi Igarashi, and Nisarg Shah. Class fairness in online match- ing. arXiv preprint arXiv:2203.03751, 2022.","title":"Class fairness in online matching","authors":"Hadi Hosseini, Zhiyi Huang, Ayumi Igarashi, Nisarg Shah","year":"2022","venue":null,"doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Jaillet and Lu, 2014] Patrick Jaillet and Xin Lu. Online stochastic matching: New algorithms with better bounds. Mathematics of Operations Research, 39(3):624-646, 2014.","title":"Online stochastic matching: New algorithms with better bounds","authors":"Lu ; Jaillet, Patrick Jaillet, Xin Lu","year":"2014","venue":"Mathematics of Operations Research","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Janiak and Kovalyov, 1996] Adam Janiak and Mikhail Y. Kovalyov. Single machine scheduling subject to deadlines and resource dependent processing times. European Jour- nal of Operational Research, 94(2):284-291, 1996.","title":"Single machine scheduling subject to deadlines and resource dependent processing times","authors":"Adam Janiak, Mikhail Y Kovalyov","year":"1996","venue":"European Journal of Operational Research","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Karp et al., 1990] R. M. Karp, U. V. Vazirani, and V. V. Vazirani. An optimal algorithm for on-line bipartite matching. In Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing, STOC '90, page 352-358, New York, NY, USA, 1990. Association for Computing Machinery.","title":"An optimal algorithm for on-line bipartite matching","authors":"R M Karp, U V Vazirani, V V Vazirani","year":"1990","venue":"Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing, STOC '90","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Koca et al., 2015] Esra Koca, Hande Yaman, and M. Selim Aktürk. Stochastic lot sizing problem with controllable processing times. Omega, 53:1-10, 2015.","title":"Stochastic lot sizing problem with controllable processing times","authors":"Esra Koca, Hande Yaman, M Selim Aktürk","year":"2015","venue":"Omega","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Koca et al., 2018] Esra Koca, Hande Yaman, and M. Se- lim Aktürk. Stochastic lot sizing problem with nervous- ness considerations. Computers & Operations Research, 94:23-37, 2018.","title":"Stochastic lot sizing problem with nervousness considerations","authors":"Esra Koca, Hande Yaman, M Selim Aktürk","year":"2018","venue":"Computers & Operations Research","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Liu et al., 2021] Hao Liu, Qiang Zhao, Yike Ma, and Feng Dai. Bipartite matching for crowd counting with point su- pervision. In IJCAI, pages 860-866, 2021.","title":"Bipartite matching for crowd counting with point supervision","authors":"Hao Liu, Qiang Zhao, Yike Ma, Feng Dai","year":"2021","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2021/119"},{"position":19,"raw":"[Lowalekar et al., 2020] Meghna Lowalekar, Pradeep Varakantham, and Patrick Jaillet. Competitive ratios for online multi-capacity ridesharing. In Proceedings of the 19th International Conference on Autonomous Agents and MultiAgent Systems, AAMAS '20, page 771-779, Rich- land, SC, 2020. International Foundation for Autonomous Agents and Multiagent Systems. [Lowalekar et al., 2021]","title":"Competitive ratios for online multi-capacity ridesharing","authors":"Meghna Lowalekar, Pradeep Varakantham, Patrick Jaillet","year":"2020","venue":"Proceedings of the 19th International Conference on Autonomous Agents and MultiAgent Systems, AAMAS '20","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"Meghna Lowalekar, Pradeep Varakantham, and Patrick Jaillet. Zac: A zone path construction approach for effective real-time ridesharing. volume 29, pages 528-538, May 2021.","title":"Zac: A zone path construction approach for effective real-time ridesharing","authors":"Meghna Lowalekar, Pradeep Varakantham, Patrick Jaillet","year":"2021","venue":null,"doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Lu et al., 2017] Chao Lu, Liang Gao, Xinyu Li, and Shengqiang Xiao. A hybrid multi-objective grey wolf op- timizer for dynamic scheduling in a real-world welding in- dustry. Engineering Applications of Artificial Intelligence, 57:61-79, 2017.","title":"A hybrid multi-objective grey wolf optimizer for dynamic scheduling in a real-world welding industry","authors":"Chao Lu, Liang Gao, Xinyu Li, Shengqiang Xiao","year":"2017","venue":"Engineering Applications of Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Ma et al., 2020] Will Ma, Pan Xu, and Yifan Xu. Group- level fairness maximization in online bipartite matching. arXiv preprint arXiv:2011.13908, 2020.","title":"Grouplevel fairness maximization in online bipartite matching","authors":"Will Ma, Pan Xu, Yifan Xu","year":"2020","venue":null,"doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Mahesh, 2020] Batta Mahesh. Machine learning algorithms-a review. International Journal of Science and Research (IJSR).[Internet], 9:381-386, 2020.","title":"Machine learning algorithms-a review","authors":"Mahesh Batta","year":"2020","venue":"International Journal of Science and Research (IJSR)","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Mehta et al., 2007] Aranyak Mehta, Amin Saberi, Umesh Vazirani, and Vijay Vazirani. Adwords and generalized online matching. Journal of the ACM (JACM), 54(5):22- es, 2007.","title":"Adwords and generalized online matching","authors":"Mehta","year":"2007","venue":"Journal of the ACM (JACM)","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Mehta et al., 2015] Aranyak Mehta, Bo Waggoner, and Morteza Zadimoghaddam. Online stochastic matching with unequal probabilities. pages 1388-1404. SIAM, 2015.","title":"Online stochastic matching with unequal probabilities","authors":"Mehta","year":"2015","venue":null,"doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Mehta, 2013] Aranyak Mehta. Online matching and ad allo- cation. Foundations and Trends® in Theoretical Computer Science, 8(4):265-368, 2013.","title":"Aranyak Mehta. Online matching and ad allocation","authors":"Mehta","year":"2013","venue":"Foundations and Trends® in Theoretical Computer Science","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Nanda et al., 2020] Vedant Nanda, Pan Xu, Karthik Abhi- nav Sankararaman, John Dickerson, and Aravind Srini- vasan. Balancing the tradeoff between profit and fairness in rideshare platforms during high-demand hours. Pro- ceedings of the AAAI Conference on Artificial Intelligence, 34(02):2210-2217, Apr. 2020.","title":"Balancing the tradeoff between profit and fairness in rideshare platforms during high-demand hours","authors":"Pan Vedant Nanda, Karthik Xu, John Abhinav Sankararaman, Aravind Dickerson, Srinivasan","year":"2020","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Shabtay and Kaspi, 2006] Dvir Shabtay and Moshe Kaspi. Parallel machine scheduling with a convex resource con- sumption function. European Journal of Operational Re- search, 173(1):92-107, 2006.","title":"Parallel machine scheduling with a convex resource consumption function","authors":"Kaspi Shabtay, Dvir Shabtay, Moshe Kaspi","year":"2006","venue":"European Journal of Operational Research","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Shabtay and Steiner, 2007] Dvir Shabtay and George Steiner. A survey of scheduling with controllable processing times. Discrete Applied Mathematics, 155(13):1643-1666, 2007.","title":"Dvir Shabtay and George Steiner. A survey of scheduling with controllable processing times","authors":"Steiner Shabtay","year":"2007","venue":"Discrete Applied Mathematics","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Sumita et al., 2022] Hanna Sumita, Shinji Ito, Kei Take- mura, Daisuke Hatano, Takuro Fukunaga, Naonori Kakimura, and Ken-ichi Kawarabayashi. Online task as- signment problems with reusable resources. In Proceed- ings of the AAAI Conference on Artificial Intelligence, vol- ume 36, pages 5199-5207, 2022.","title":"Online task assignment problems with reusable resources","authors":"Hanna Sumita, Shinji Ito, Kei Takemura, Daisuke Hatano, Takuro Fukunaga, Naonori Kakimura, Ken-Ichi Kawarabayashi","year":"2022","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Tafreshian et al., 2020] Amirmahdi Tafreshian, Neda Ma- soud, and Yafeng Yin. Frontiers in service science: Ride matching for peer-to-peer ride sharing: A review and fu- ture directions. Service Science, 12(2-3):44-60, 2020.","title":"Amirmahdi Tafreshian, Neda Masoud, and Yafeng Yin. Frontiers in service science: Ride matching for peer-to-peer ride sharing: A review and future directions","authors":"Tafreshian","year":"2020","venue":"Service Science","doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Taia, 2022] Taia. Select your translation delivery dates with ease. https://taia.io/features/translation-delivery-dates/, 2022. Accessed: 2023-01-13.","title":"Taia. Select your translation delivery dates with ease","authors":"Taia","year":"2022","venue":null,"doi":null,"url":"https://taia.io/features/translation-delivery-dates/,2022","internal_url":null},{"position":33,"raw":"[Tong et al., 2020] Yongxin Tong, Zimu Zhou, Yuxiang Zeng, Lei Chen, and Cyrus Shahabi. Spatial crowdsourc- ing: a survey. The VLDB Journal, 29(1):217-250, 2020.","title":"Spatial crowdsourcing: a survey","authors":"Yongxin Tong, Zimu Zhou, Yuxiang Zeng, Lei Chen, Cyrus Shahabi","year":"2020","venue":"The VLDB Journal","doi":null,"url":null,"internal_url":null},{"position":34,"raw":"[Tunc, 2021] Huseyin Tunc. A mixed integer programming formulation for the stochastic lot sizing problem with con- trollable processing times. Computers & Operations Re- search, 132:105302, 2021.","title":"A mixed integer programming formulation for the stochastic lot sizing problem with controllable processing times","authors":"Huseyin Tunc","year":"2021","venue":"Computers & Operations Research","doi":null,"url":null,"internal_url":null},{"position":35,"raw":"[Wang et al., 2017] Du-Juan Wang, Feng Liu, and Yaochu Jin. A multi-objective evolutionary algorithm guided by directed search for dynamic scheduling. Computers & Op- erations Research, 79:279-290, 2017.","title":"A multi-objective evolutionary algorithm guided by directed search for dynamic scheduling","authors":"Du-Juan Wang, Feng Liu, Yaochu Jin","year":"2017","venue":"Computers & Operations Research","doi":null,"url":null,"internal_url":null},{"position":36,"raw":"[Wang et al., 2019] Zizhao Wang, Wei Bao, Dong Yuan, Liming Ge, Nguyen H. Tran, and Albert Y. Zomaya. See: Scheduling early exit for mobile dnn inference dur- ing service outage. In Proceedings of the 22nd Interna- tional ACM Conference on Modeling, Analysis and Sim- ulation of Wireless and Mobile Systems, MSWIM '19, page 279-288, New York, NY, USA, 2019. Association for Computing Machinery.","title":"See: Scheduling early exit for mobile dnn inference during service outage","authors":"Zizhao Wang, Wei Bao, Dong Yuan, Liming Ge, H Nguyen, Albert Y Tran, Zomaya","year":"2019","venue":"Proceedings of the 22nd International ACM Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems, MSWIM '19","doi":null,"url":null,"internal_url":null},{"position":37,"raw":"[Wu et al., 2023] Ruoyu Wu, Wei Bao, and Liming Ge. On- line task assignment with controllable processing time. arXiv preprint arXiv:2305.04453, 2023.","title":"Online task assignment with controllable processing time","authors":"Ruoyu Wu, Wei Bao, Liming Ge","year":"2023","venue":null,"doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}