We consider the problem of scheduling jobs that arrive online in the unrelated machine model to minimize `k norms of weighted flowtime. In the unrelated setting, the processing time and weight of a job depends on the machine it is assigned to, and it is perhaps the most general machine model considered in scheduling literature. Chadha et al. [10] obtained a recent breakthrough result in obtaini...

We consider an uncertain single-machine scheduling problem, in which the processing time of a job can take any real value on a given closed interval. The criterion is to minimize the total weighted flow time of the n jobs, where there is a weight associated with a job. We calculate a number of minimal dominant sets of the job permutations (a minimal dominant set contains at least one optimal pe...

We consider online job scheduling together with power management on multiple machines. In this model, jobs with arbitrary sizes and weights arrive online, and each machine consumes different amount of energy when it is processing a job, idling or sleeping. A scheduler has to maintain a good balance of the states of the machines to avoid energy wastage, while giving an efficient schedule of the ...

Multiplying the heuristic function by a weight greater than one is a well-known technique in Heuristic Search. When applied to A* with an admissible heuristic it yields substantial runtime savings, at the expense of sacrificing solution optimality. Only a few works have studied the applicability of this technique to Real-Time Heuristic Search (RTHS), a search approach that builds upon Heuristic...

Co-flows model a modern scheduling setting that is commonly found in a variety of applications in distributed and cloud computing. In co-flow scheduling, there are m input ports and m output ports. Each co-flow j ∈ J can be represented by a bipartite graph between the input and output ports, where each edge (i, o) with demand dji,o means that d j i,o units of packets must be delivered from port...

UNLABELLED Data with the highest possible signal-to-noise (S/N) ratios are desirable when performing nonquantitative perturbation studies with PET and 15O-water. To achieve this, protocols have been suggested in which the stimulus is switched off before the washout phase. An alternative strategy is suggested for cases in which the stimulus is not easily discontinued. METHODS For a given subje...

Sanjeev Khanna University of Pennsylvania 11.

The minimum weighted completion time problem involves (i) a set J of n jobs, a positive weight wj for each job j ∈ J , and a release date rj before which it cannot be scheduled; (ii) a set of m machines, each of which can process at most one job at any time, and (iii) an arbitrary set of positive values {pi,j}, where pi,j denotes the time to process job j on machine i. A schedule involves assig...

Geographic range margins offer testing grounds for limits to adaptation. If range limits are concordant with niche limits, range expansions require the evolution of new phenotypes that can maintain populations beyond current range margins. However, many species' range margins appear static over time, suggesting limits on the ability of marginal populations to evolve appropriate phenotypes. A po...