Cited By
View all- Bonifaci VKorteweg PMarchetti-Spaccamela AStougie L(2011)Minimizing flow time in the wireless gathering problemACM Transactions on Algorithms (TALG)10.1145/1978782.19787887:3(1-20)Online publication date: 15-Jul-2011
We study online scheduling of jobs to minimize the flow time and stretch on parallel machines. We consider algorithms that are given extra resources so as to compensate for the lack of future information. Recent results show that a modest increase in ...
We consider preemptive online and semi-online scheduling of unit jobs on two uniformly related machines. Jobs are presented one by one to an algorithm, and each job has a rejection penalty associated with it. A new job can either be rejected, in which ...
In this paper, we study a new primary-secondary bicriteria scheduling problem on identical machines. The primary objective is to minimize the total completion time of all jobs and the secondary objective is to minimize the maximum T-time of all machines,...
Society for Industrial and Applied Mathematics
United States
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in