Now showing items 1-2 of 2
Scheduling to minimize the coefficient of variation
In this paper, we address the problem of uninterruptedly scheduling a set of independent jobs that are ready at time zero with the objective of minimizing the coefficient of variation (CV) of their completion times. We ...
Batch scheduling to minimize the weighted number of tardy jobs
(Pergamon Press, 2007)
In this paper, we address a single-machine scheduling problem with due dates and batch setup times to minimize the weighted number of tardy jobs. We give a pseudo-polynomial dynamic program and a fully-polynomial approximation ...