Job shop scheduling using GAMS(infeasible, unbounded,nonopt)
Posted: Sun Jun 16, 2019 4:22 pm
Sir,
I am a student working on a project for scheduling of machines in a job shop. This is my first time working with gams.
I wrote the program to get the minimum completion time and the optimum scheduling sequence.
The minimum completion time as per my given inputs was obtained but the sequence could not be generated.
I would be obliged if you can help me solve this problem.
I have attached my gams program.
Thank you.
Rgds, Mahadev Prem
I am a student working on a project for scheduling of machines in a job shop. This is my first time working with gams.
I wrote the program to get the minimum completion time and the optimum scheduling sequence.
The minimum completion time as per my given inputs was obtained but the sequence could not be generated.
I would be obliged if you can help me solve this problem.
I have attached my gams program.
Thank you.
Rgds, Mahadev Prem