<s>
In	O
operations	O
research	O
,	O
the	O
makespan	B-Algorithm
of	O
a	O
project	O
is	O
the	O
length	O
of	O
time	O
that	O
elapses	O
from	O
the	O
start	O
of	O
work	O
to	O
the	O
end	O
.	O
</s>
<s>
This	O
type	O
of	O
multi-mode	O
resource	O
constrained	O
project	O
scheduling	O
problem	O
(	O
MRCPSP	O
)	O
seeks	O
to	O
create	O
the	O
shortest	O
logical	O
project	O
schedule	O
,	O
by	O
efficiently	O
using	O
project	O
resources	O
,	O
adding	O
the	O
lowest	O
number	O
of	O
additional	O
resources	O
as	O
possible	O
to	O
achieve	O
the	O
minimum	O
makespan	B-Algorithm
.	O
</s>
<s>
If	O
we	O
let	O
Shmuel	O
feed	O
all	O
goats	O
,	O
then	O
the	O
makespan	B-Algorithm
is	O
30	O
(	O
3×10	O
for	O
Shmuel	O
,	O
0	O
for	O
Shifra	O
)	O
;	O
</s>
<s>
If	O
we	O
let	O
Shifra	O
feed	O
one	O
goat	O
and	O
Shmuel	O
two	O
goats	O
,	O
then	O
the	O
makespan	B-Algorithm
is	O
20	O
(	O
2×10	O
for	O
Shmuel	O
,	O
12	O
for	O
Shifra	O
working	O
beside	O
and	O
in	O
parallel	O
to	O
Shmuel	O
)	O
;	O
</s>
<s>
If	O
we	O
let	O
Shifra	O
feed	O
two	O
goats	O
and	O
Shmuel	O
one	O
goat	O
,	O
then	O
the	O
makespan	B-Algorithm
is	O
24	O
(	O
2×12	O
for	O
Shifra	O
,	O
10	O
for	O
Samuel	O
working	O
beside	O
and	O
in	O
parallel	O
to	O
Shifra	O
)	O
;	O
</s>
<s>
If	O
we	O
let	O
Shifra	O
feed	O
all	O
goats	O
,	O
then	O
the	O
makespan	B-Algorithm
is	O
36	O
(	O
3×12	O
for	O
Shifra	O
,	O
0	O
for	O
Shmuel	O
)	O
.	O
</s>
<s>
So	O
in	O
this	O
case	O
,	O
the	O
second	O
schedule	O
attains	O
the	O
shortest	O
makespan	B-Algorithm
,	O
which	O
is	O
20	O
.	O
</s>
<s>
Job	B-Algorithm
shop	I-Algorithm
scheduling	I-Algorithm
–	O
there	O
are	O
n	O
jobs	O
and	O
m	O
identical	O
stations	O
.	O
</s>
<s>
Open-shop	B-Algorithm
scheduling	I-Algorithm
–	O
there	O
are	O
n	O
jobs	O
and	O
m	O
different	O
stations	O
.	O
</s>
<s>
Flow	B-Algorithm
shop	I-Algorithm
scheduling	I-Algorithm
–	O
there	O
are	O
n	O
jobs	O
and	O
m	O
different	O
stations	O
.	O
</s>
<s>
Fair	O
makespan	B-Algorithm
minimization	O
-	O
When	O
assigning	O
tasks	O
to	O
agents	O
,	O
it	O
is	O
required	O
both	O
to	O
minimize	O
the	O
makespan	B-Algorithm
,	O
and	O
to	O
avoid	O
envy	O
.	O
</s>
