Today's article comes from the International Journal of Mathematical, Engineering and Management Sciences. The authors are Rani et al., from Chitkara University, in India. In this paper they propose two new algorithms: Min-CCV and Min-V, which attempt to solve a task-allocation problem in polynomial time. Let's see how they did.
DOI: 10.33889/IJMEMS.2024.9.6.072
You must be an active Journal Club member to access this content. If you're already a member, click the blue button to login. If you're not a member yet, click the sign-up button to get started.
Login to My Account
Sign Up