Notes on max flow time minimization with controllable processing times
In a scheduling problem with controllable processing times the job processing time can be compressed through incurring an additional cost. We consider the identical parallel machines max flow time minimization problem with controllable processing times. We address the preemptive and non-preemptive version of the problem. For the preemptive case, a linear programming formulation is presented which solves the problem optimally in polynomial time. For the non-preemptive problem it is shown that the First In First Out (FIFO) heuristic has a tight worst-case performance of 3-2/m, when jobs processing times and costs are set as in some optimal preemptive schedule.
controllable processing times scheduling parallel machines approximation algorithms