You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
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.
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.)
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.
The text was updated successfully, but these errors were encountered:
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.
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.
The text was updated successfully, but these errors were encountered: