and compiler
for each
,
set-up time
for each
.
, a partition of
t
into any number of subtasks
such that
and an assignment
that assigns to each subtask
of
t
a pair of nonnegative integers
such that
and, for
,
.
Such a schedule must satisfy the following additional constraint:
Whenever two subtasks
of
t
and
of
t'
with
are
scheduled consecutively on the same machine (i.e.,
and no other subtask
has
and
),
then
if they have the same
compiler (i.e.,
c(t) = c(t')
) and
if they have different compilers.
.
and admits an FPTAS for
m=2
[
346
].
Viggo Kann