I need to solve a problem using Integer Programming.
The Problem is a factory with n Operations and m Machines. There are pij times of processing (for operation i and machine j), and every operation can be done in every machine. This is a case of parallel machines
There are precedence...