Example $1.$ Process oriented

From Trips between processes

To

A B C D E F

A $1825731254$

B $96233145$

C $412220$

D $1957$

E $48$

F

Which option minimizes the total cost?

Two available options:

Example $2.$ Process oriented $($use trips between processes from Example $1)$

$$ Moving a load between adjacent departments cost $1$$

$$ Moving a load between nonadjacent departments cost $2$$

$$ Work areas that are diagonal to one another are treated as adjacent

Between below available options, which one minimizes the cost?

Task Time Immediate Predecessors

A $7-$

B $3$ A

C $1$ A

D $6$ B

E $5$ C$,$D

Example $3.$ Assembly$-$line balancing

$$ Daily demand: $6$

$$ Available minutes: $60$

Task Time Immediate Predecessors

A $1-$

B $3$ A

C $2$ B

D $4$ B

E $1$ C$,$D

F $3$ A

G $2$ F

H $5$ G

I $1$ E$,$H

J $3$ I

Example $4.$ Assembly$-$line balancing

$$ Daily demand: $60$

$$ Available minutes: $400$