We consider an on-line scheduling problem, where jobs arrive one by one to be scheduled on two identical parallel processors with preemption. The objective is to minimize the machine completion time vector with respect to the lp norm. We present a best possible deterministic on-line scheduling algorithm along with a matching lower bound.

OBJECTIVE To describe pediatric housestaff resuscitation experience and their ability to perform key resuscitation skills. DESIGN Cohort study of 63 pediatric residents in a university-based training program. PARTICIPANTS AND METHODS Investigators observed, scored, and timed resident performance on 4 key resuscitation skills. Cognitive ability was tested with 4 written scenarios. Housestaff...

This paper studies the effects of tuning delay of transmitters in packet-based optical broadcast networks. We consider scheduling of random traffic with tunable transmitters and fixed-tuned receivers and obtain the degradation imposed by tuning delay using several performance criteria, such as schedule completion time, average packet delay, and session blocking rates. We show that for off-line ...

An increasingly significant branch of computer science is the study of on-line algorithms. In this paper, we apply the theory of on-line algorithms to job scheduling. In particular, we study the nonpreemptive single machine scheduling of independent jobs with arbitrary release dates to minimize the total completion time. We design and analyze two on-line algorithms which make scheduling decisio...

In this study, we establish generaized Grüss type inequality and some generaized Cebysev type inequalities for local fractional integrals on frac-tal sets R (0 < 1) of real line numbers.