Formulate an IP using big-M: In a system, there n total jobs that need to be completed by m total machines.

Formulate an IP using big-M:

In a system, there n total jobs that need to be completed by m total machines. Each job has to visit each machine is a certain order, and each one of these steps has a unique processing time. So, for example, job i has to go to machine a, then machine b, then machine c, and spends a different amount of time at each machine (another variable). Machines can only process one job at a time. minimize the total time by scheduling each job...