Mathematics of Operations Research, Vol. 29, No. 3 (Aug., 2004), pp. 686-697 (12 pages) This paper considers the online scheduling of a single machine in which jobs arrive over time, and preemption is ...

The paper is devoted to some single machine scheduling problems, where job processing times are defined by functions dependent on their positions in the sequence. It is assumed that each job is ...