Minimizing the weighted completion time on an integrated single machine scheduling problem with maintenance activities

2018 ◽  
Author(s):  
Ya-Chih Tsai ◽  
Ful-Chiang Wu ◽  
Fuh-Der Chou
Keyword(s):  
Single Machine ◽  
Completion Time ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Scheduling Problem ◽  
Weighted Completion Time ◽  
Maintenance Activities

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

2018 ◽  
Vol 35 (06) ◽  
pp. 1850048
Author(s):  
Xing Chai ◽  
Lingfa Lu ◽  
Wenhua Li ◽  
Liqi Zhang
Keyword(s):  
Online Algorithms ◽  
Single Machine ◽  
Competitive Ratio ◽  
Completion Time ◽  
Online Algorithm ◽  
Optimal Schedule ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Asia Pacific ◽  
Weighted Completion Time

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 first) rule yields an optimal schedule. For the non-preemptive problem, Li [Li, W (2015). A best possible online algorithm for the parallel-machine scheduling to minimize the maximum weighted completion time. Asia-Pacific Journal of Operational Research, 32(4), 1550030 (10 pages)] presented a lower bound 2, and then provided an online algorithm with a competitive ratio of 3. In this paper, we present two online algorithms with the best-possible competitive ratio of [Formula: see text] for the non-preemptive problem.

Sign in / Sign up

Export Citation Format

Share Document