Article Contents
Article Contents

# Optimal preemptive online scheduling to minimize lp norm on two processors

• 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 $l_p$ norm. We present a best possible deterministic on-line scheduling algorithm along with a matching lower bound.
Mathematics Subject Classification: 90B35, 68Q17, 68Q25, 68W25, 68W40.

 Citation: