1 research outputs found
Approximating the -Machine Flow Shop Problem with Exact Delays Taking Two Values
In the -Machine Flow Shop problem with exact delays the operations of each
job are separated by a given time lag (delay). Leung et al. (2007) established
that the problem is strongly NP-hard when the delays may have at most two
different values. We present further results for this case: we prove that the
existence of -approximation implies PNP and present a
-approximation algorithm.Comment: 8 pages, 6 figure