Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Implement Solution for Painter's Partition Problem #78

Open
Salonisaroha opened this issue Oct 15, 2024 · 2 comments
Open

Implement Solution for Painter's Partition Problem #78

Salonisaroha opened this issue Oct 15, 2024 · 2 comments
Assignees

Comments

@Salonisaroha
Copy link

Please @mrigaankzoro assign me the following issue.
I would like to implement a solution for the Painter's Partition Problem, which involves distributing tasks among multiple painters to minimize the maximum time taken. The problem has practical applications in areas like task scheduling, load balancing, and resource allocation.

Approach:
I plan to use a binary search algorithm combined with a feasibility check to determine the optimal solution efficiently. The implementation will focus on balancing the workload among painters while minimizing the maximum time required.

@bhavesh-2004
Copy link
Contributor

@mrigaankzoro, please assign me the issue regarding the Painter's Partition Problem. I aim to implement an efficient solution that distributes tasks among multiple painters to minimize the maximum time taken. My approach will utilize a binary search algorithm alongside a feasibility check to effectively balance the workload while optimizing the overall time required.

@Mrdanish24
Copy link
Contributor

hello sir
please assign me

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

4 participants