Question: Integer programming problem Job j takes t; time units to complete for j = 1,..., n. There are two identical machines which can be run
Integer programming problem
Job j takes t; time units to complete for j = 1,..., n. There are two identical machines which can be run simultaneously. Each machine can process one job at a time. Each job must be run on one of the two machines. The completion time c; of job j is the time at which it is completed. Model the problem of finding a schedule that minimizes max1
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
