JIANG, YIWEI; HE, YONG - In: Asia-Pacific Journal of Operational Research (APJOR) 23 (2006) 01, pp. 77-88
In this paper, we consider a semi-online preemptive scheduling problem on two uniform machines, where we assume that all jobs have sizes between p and rp for some p 0 and r ≥ 1. The goal is to maximize the continuous period of time (starting from time zero) when both machines are busy. We...