Open Science Research Excellence

Open Science Index

Commenced in January 2007 Frequency: Monthly Edition: International Publications Count: 31176


Select areas to restrict search in scientific publication database:
10011414
Resource Allocation and Task Scheduling with Skill Level and Time Bound Constraints
Abstract:
Task Assignment and Scheduling is a challenging Operations Research problem when there is a limited number of resources and comparatively higher number of tasks. The Cost Management team at Cummins needs to assign tasks based on a deadline and must prioritize some of the tasks as per business requirements. Moreover, there is a constraint on the resources that assignment of tasks should be done based on an individual skill level, that may vary for different tasks. Another constraint is for scheduling the tasks that should be evenly distributed in terms of number of working hours, which adds further complexity to this problem. The proposed greedy approach to solve assignment and scheduling problem first assigns the task based on management priority and then by the closest deadline. This is followed by an iterative selection of an available resource with the least allocated total working hours for a task, i.e. finding the local optimal choice for each task with the goal of determining the global optimum. The greedy approach task allocation is compared with a variant of Hungarian Algorithm, and it is observed that the proposed approach gives an equal allocation of working hours among the resources. The comparative study of the proposed approach is also done with manual task allocation and it is noted that the visibility of the task timeline has increased from 2 months to 6 months. An interactive dashboard app is created for the greedy assignment and scheduling approach and the tasks with more than 2 months horizon that were waiting in a queue without a delivery date initially are now analyzed effectively by the business with expected timelines for completion.
Digital Object Identifier (DOI):

References:

[1] R. Aboudi and K. Jornsten, Resource Constrained Assignment Problems: Discrete Applied Mathematics 26) 175-191 North-Holland (1990) https://core.ac.uk/download/pdf/82253919.pdf
[2] G. Georgiadis, A. Elekidis, Optimization-Based Scheduling for the Process Industries: From Theory to Real-Life Industrial Applications, Processes 2019, 7, 438. https://doi.org/10.3390/pr7070438
[3] S. Dhall, C. Liu, On a Real-Time Scheduling Problem, Operations Research Journal Vol. 26, No. 1, (Feb 1978) https://doi.org/10.1287/opre.26.1.127
[4] T. Nehzati, N. Ismail, Application of Artificial Intelligent in Production Scheduling: a critical evaluation and comparison of key approaches, International Conference on Industrial Engineering and Operations Management Kuala Lumpur, Malaysia, (January 22 – 24, 2011) http://ieomsociety.org/ieom2011/pdfs/IEOM007.pdf
[5] H.S. Stone, “Multiprocessor Scheduling with the Aid of Network Flow Algorithms” IEEE Trans. Software Eng., vol. 3, no. 1, pp. 85-93, (Jan. 1977) https://ieeexplore.ieee.org/document/1702405
[6] W. Kuhn, The Hungarian Method for the Assignment Problem, Bryn Yaw College https://web.eecs.umich.edu/~pettie/matching/Kuhn-hungarian-assignment.pdf
[7] G. Korsah, M. Dias, A. Stentz, A Comprehensive Taxonomy for Multi-Robot Task Allocation, International Journal of Robotics Research 32. 1495-1512. 10.1177/0278364913496484. (2013) http://www.cs.cmu.edu/afs/cs/Web/People/gertrude/documents/Korsah_IJRR_Taxonomy.pdf
[8] A. Malik, A. Sharma, V. Saroha. International Journal of Scientific and Research Publications. Greedy Algorithm. Volume 3, Issue 8, ISSN 2250-3153, (August 2013) https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.642.4368&rep=rep1&type=pdf
[9] Z. Dong, N. Liu, R.Cessa, Greedy scheduling of tasks with time constraints for energy-efficient cloud-computing data centers. Journal of Cloud Computing. 4. 10.1186/s13677-015-0031-y, (2015). https://www.researchgate.net/publication/276886824_Greedy_scheduling_of_tasks_with_time_constraints_for_energy-efficient_cloud-computing_data_centers/link/5612c21608aea34aa9299a9f/download
[10] R. Mohan, N.Gopalan, Task Assignment for Heterogeneous Computing Problems using Improved Iterated Greedy Algorithm. International Journal of Computer Network and Information Security. 6. 50-55. 10.5815/ijcnis.2014.07.07, (2014). https://www.researchgate.net/publication/276230469_Task_Assignment_for_Heterogeneous_Computing_Problems_using_Improved_Iterated_Greedy_Algorithm/link/589becd3a6fdcc75417435e0/download
[11] V. Adlakha and H. Arsham, Managing Cost Uncertainties in Transportation and Assignment, Journal of Applied Mathematics Decision Science, 2(1), 65-104 (1998) http://www.kurims.kyoto-u.ac.jp/EMIS/journals/HOA/JAMDS/Volume2_1/104.pdf
[12] C. Zorlu, Project Overview of Breast Cancer Treatment, Hult Business School (2020) https://www.academia.edu/42775787/PROJECT_OVERVIEW_OF_BREAST_CANCER_TREATMENT
Vol:15 No:04 2021Vol:15 No:03 2021Vol:15 No:02 2021Vol:15 No:01 2021
Vol:14 No:12 2020Vol:14 No:11 2020Vol:14 No:10 2020Vol:14 No:09 2020Vol:14 No:08 2020Vol:14 No:07 2020Vol:14 No:06 2020Vol:14 No:05 2020Vol:14 No:04 2020Vol:14 No:03 2020Vol:14 No:02 2020Vol:14 No:01 2020
Vol:13 No:12 2019Vol:13 No:11 2019Vol:13 No:10 2019Vol:13 No:09 2019Vol:13 No:08 2019Vol:13 No:07 2019Vol:13 No:06 2019Vol:13 No:05 2019Vol:13 No:04 2019Vol:13 No:03 2019Vol:13 No:02 2019Vol:13 No:01 2019
Vol:12 No:12 2018Vol:12 No:11 2018Vol:12 No:10 2018Vol:12 No:09 2018Vol:12 No:08 2018Vol:12 No:07 2018Vol:12 No:06 2018Vol:12 No:05 2018Vol:12 No:04 2018Vol:12 No:03 2018Vol:12 No:02 2018Vol:12 No:01 2018
Vol:11 No:12 2017Vol:11 No:11 2017Vol:11 No:10 2017Vol:11 No:09 2017Vol:11 No:08 2017Vol:11 No:07 2017Vol:11 No:06 2017Vol:11 No:05 2017Vol:11 No:04 2017Vol:11 No:03 2017Vol:11 No:02 2017Vol:11 No:01 2017
Vol:10 No:12 2016Vol:10 No:11 2016Vol:10 No:10 2016Vol:10 No:09 2016Vol:10 No:08 2016Vol:10 No:07 2016Vol:10 No:06 2016Vol:10 No:05 2016Vol:10 No:04 2016Vol:10 No:03 2016Vol:10 No:02 2016Vol:10 No:01 2016
Vol:9 No:12 2015Vol:9 No:11 2015Vol:9 No:10 2015Vol:9 No:09 2015Vol:9 No:08 2015Vol:9 No:07 2015Vol:9 No:06 2015Vol:9 No:05 2015Vol:9 No:04 2015Vol:9 No:03 2015Vol:9 No:02 2015Vol:9 No:01 2015
Vol:8 No:12 2014Vol:8 No:11 2014Vol:8 No:10 2014Vol:8 No:09 2014Vol:8 No:08 2014Vol:8 No:07 2014Vol:8 No:06 2014Vol:8 No:05 2014Vol:8 No:04 2014Vol:8 No:03 2014Vol:8 No:02 2014Vol:8 No:01 2014
Vol:7 No:12 2013Vol:7 No:11 2013Vol:7 No:10 2013Vol:7 No:09 2013Vol:7 No:08 2013Vol:7 No:07 2013Vol:7 No:06 2013Vol:7 No:05 2013Vol:7 No:04 2013Vol:7 No:03 2013Vol:7 No:02 2013Vol:7 No:01 2013
Vol:6 No:12 2012Vol:6 No:11 2012Vol:6 No:10 2012Vol:6 No:09 2012Vol:6 No:08 2012Vol:6 No:07 2012Vol:6 No:06 2012Vol:6 No:05 2012Vol:6 No:04 2012Vol:6 No:03 2012Vol:6 No:02 2012Vol:6 No:01 2012
Vol:5 No:12 2011Vol:5 No:11 2011Vol:5 No:10 2011Vol:5 No:09 2011Vol:5 No:08 2011Vol:5 No:07 2011Vol:5 No:06 2011Vol:5 No:05 2011Vol:5 No:04 2011Vol:5 No:03 2011Vol:5 No:02 2011Vol:5 No:01 2011
Vol:4 No:12 2010Vol:4 No:11 2010Vol:4 No:10 2010Vol:4 No:09 2010Vol:4 No:08 2010Vol:4 No:07 2010Vol:4 No:06 2010Vol:4 No:05 2010Vol:4 No:04 2010Vol:4 No:03 2010Vol:4 No:02 2010Vol:4 No:01 2010
Vol:3 No:12 2009Vol:3 No:11 2009Vol:3 No:10 2009Vol:3 No:09 2009Vol:3 No:08 2009Vol:3 No:07 2009Vol:3 No:06 2009Vol:3 No:05 2009Vol:3 No:04 2009Vol:3 No:03 2009Vol:3 No:02 2009Vol:3 No:01 2009
Vol:2 No:12 2008Vol:2 No:11 2008Vol:2 No:10 2008Vol:2 No:09 2008Vol:2 No:08 2008Vol:2 No:07 2008Vol:2 No:06 2008Vol:2 No:05 2008Vol:2 No:04 2008Vol:2 No:03 2008Vol:2 No:02 2008Vol:2 No:01 2008
Vol:1 No:12 2007Vol:1 No:11 2007Vol:1 No:10 2007Vol:1 No:09 2007Vol:1 No:08 2007Vol:1 No:07 2007Vol:1 No:06 2007Vol:1 No:05 2007Vol:1 No:04 2007Vol:1 No:03 2007Vol:1 No:02 2007Vol:1 No:01 2007