Developing an Interface to Schedule a Job Shop Under Finite Capacities
Environment
Student Name: Chaitanya V. Baindur
C++ Codes were developed to generate an Integer
Programming (IP) model for scheduling of job-shops with finite capacities.
Though IP is known to be $n-p$ hard for this scheduling problem, the C++ codes
were useful in automatically generating MPS (Mathematical Programming System)
codes to be fed into the OSL (Optimization Software Library) package to obtain
the final results. This helped the end user, who could easily specify a job
scheduling problem using simple specifications, without worrying or having
any knowledge about its IP formulation, and obtain the desired optimal
results.