Best-Possible Online Algorithms for Single Machine Scheduling to Minimize the Maximum Weighted Completion Time

Xing Chai,Lingfa Lu,Wenhua Li,Liqi Zhang

Best-Possible Online Algorithms for Single Machine Scheduling to Minimize the Maximum Weighted Completion Time

2018

Xing Chai
Lingfa Lu
Wenhua Li
Liqi Zhang

In this paper, we consider the online single machine scheduling problem to minimize the maximum weighted completion time of the jobs. For the preemptive problem, we show that the LW (Largest Weight...

Keywords:

Real-time computing
Online algorithm
Single-machine scheduling
Mathematics
Mathematical optimization
completion time
Competitive analysis
Scheduling (computing)

Correction
Source
Cite
Save
Machine Reading By IdeaReader

References

Citations