INDE $4287$ HW$2$

Due Date: $05\mathrm{.}01\mathrm{.}2024$

Use any programming language to solve the following problem. Use the given sample data. Submit

your coding file with the solution.

Consider the following total completion time formulation on unrelated parallel machines. Solve this

formulation using any programming language.

$=\{$

$1$

$0$

Sample data:

Operation A B C

p$1$j $453$

p$2$j $893$

$\{0,1\}1,,,1,,,1,,.$

$11,,,1,,$

$11,,$

$..$

min

$1$

$11$

$111$

x i m j n k n

x i m k n

x j n

st

kp x

ikj

n

j

ikj

m

i

n

k

ikj

m

i

n

j

n

k

ij ikj

$$

$$

$$

$===$

$==$

$==$

$$

$$

$$

$=$

$==$

$===$