Search found 1 match
- 4 years ago
- Forum: Solvers
- Topic: Job shop scheduling using GAMS(infeasible, unbounded,nonopt)
- Replies: 0
- Views: 2671
Job shop scheduling using GAMS(infeasible, unbounded,nonopt)
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 cou...