Simulation Based Resource Optimization Using a Decision Tree Clearing Function

1Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This study presents a novel approach to resource allocation in software development teams working with Kanban. The simulation algorithm created in this study takes three types of resources, three types of work, resource capabilities, and a blocking mechanism different from the classic machine breakdown scenario. The data generated by the simulations are used to train a decision tree regression which is integrated into an optimization model as a clearing function. In numerical analysis, the research compares the decision tree clearing function to a straightforward two-step model that only takes the best of the simulation data and finds a resource allocation and a greedy heuristic algorithm which starts from an initial feasible solution and improves it step-by-step. Findings show that the developed decision tree clearing function model outperforms the other two benchmark models in mid and high amounts of data.

Cite

CITATION STYLE

APA

Ertaban, C., & Albey, E. (2024). Simulation Based Resource Optimization Using a Decision Tree Clearing Function. IEEE Access, 12, 60425–60435. https://doi.org/10.1109/ACCESS.2024.3393831

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free