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

Parallel Machines #10

Open
notmuchnerdy opened this issue Nov 28, 2022 · 0 comments
Open

Parallel Machines #10

notmuchnerdy opened this issue Nov 28, 2022 · 0 comments

Comments

@notmuchnerdy
Copy link

notmuchnerdy commented Nov 28, 2022

Dear developers,

Thank you for your impressive effort on this scheduling problem.
I would like to modify the code due to my problem but I wanted to be sure in advance if this model is capable of this problem.

I want to explain it with an example.

  1. I have 16 jobs (each job has 1 task) and 3 parallel machines (all of the jobs can be done by three parallel machines with identical processing times.)
  2. There is no specific sequence for the jobs and we think that there is no precedence between jobs.

Basically, all of the jobs (16 jobs=16 tasks) have to be processed on three identical machines without considering any sequential order. Each job has to be started and done in one machine. In your model, the solution can be found if only if the number of tasks is equal to the number of machines. May I somehow bend this rule?

Sincerely.

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

No branches or pull requests

1 participant