3 Result(s)
within
Article
Yiwei Jiang
Data Structures and Information Theory
Logics and Meanings of Programs
-
Article
Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information
In semi-online scheduling problems, we always assume that some partial additional information is exactly known in advance. This may not be true in some application. This paper considers semi-online problems on...
-
Article
Preemptive online algorithms for scheduling with machine cost
For most scheduling problems the set of machines is fixed initially and remains unchanged. Recently Imreh and Noga proposed adding the concept of machine cost to scheduling problems and considered the so-called L...
-
Article
Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines
This paper investigates two preemptive semi-online scheduling problems to minimize makespan on two uniform machines. In the first semi-online problem, we know in advance that all jobs have their processing tim...
