<s>
Talent	B-Algorithm
scheduling	I-Algorithm
is	O
an	O
optimization	O
problem	O
in	O
computer	B-General_Concept
science	I-General_Concept
and	O
operations	O
research	O
,	O
and	O
it	O
is	O
also	O
a	O
problem	O
in	O
combinatorial	O
optimization	O
.	O
</s>
<s>
The	O
purpose	O
of	O
talent	B-Algorithm
scheduling	I-Algorithm
is	O
to	O
minimize	O
the	O
actors	O
 '	O
total	O
salary	O
by	O
adjusting	O
the	O
sequence	O
of	O
scenes	O
.	O
</s>
<s>
In	O
talent	B-Algorithm
scheduling	I-Algorithm
problem	O
,	O
we	O
can	O
prove	O
that	O
is	O
NP-hard	O
by	O
a	O
reduction	O
from	O
the	O
optimal	O
linear	O
arrangement(OLA )	O
problem	O
.	O
</s>
<s>
Thus	O
,	O
this	O
problem	O
is	O
unlikely	O
to	O
have	O
pseudo-polynomial	B-Algorithm
algorithm	I-Algorithm
.	O
</s>
<s>
The	O
integer	B-Algorithm
programming	I-Algorithm
model	O
is	O
given	O
by	O
:	O
</s>
