Now showing items 1-2 of 2
Composite regions of feasibility for certain classes of distance constrained network location problems
Distance constrained network location involves locating m new facilities on a transport network G so as to satisfy upper bounds on distances between pairs of new facilities and pairs of new and existing facilities. The ...
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 ...