Single Machine Scheduling to Maximize Maximum Cost
Abstract
Problems of schedluing $n$ jobs on a single machine to maximize maximum cost are studied. The jobs may have diffrent release dates and precedence constraints may be given on the set of jobs. Only semi-active schedules are of interest. These problems arise in predicetive-reactive scheduling. The most general problem can be solved in $o(n^3)$ times. Algorithmic and computational complexity results are derived for special cases.