An optimal online algorithm for single machine scheduling with bounded delivery times

2010 ◽  
Vol 201 (3) ◽  
pp. 693-700 ◽  
Author(s):  
Ming Liu ◽  
Chengbin Chu ◽  
Yinfeng Xu ◽  
Feifeng Zheng
Keyword(s):  
Single Machine ◽  
Online Algorithm ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Delivery Times

Single Machine Scheduling and due Date Assignment with Past-Sequence-Dependent Delivery Times and General Position-Dependent Processing Times

2014 ◽  
Vol 624 ◽  
pp. 675-680
Author(s):  
Yu Fang Zhao
Keyword(s):  
Single Machine ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Scheduling Problems ◽  
Due Date ◽  
Due Date Assignment ◽  
Processing Times ◽  
Delivery Times ◽  
Weighted Number ◽  
Tardy Jobs

We studied single machine scheduling problems in which the jobs need to be delivered to customers after processing. It is assumed that the delivery times are proportional to the length of the already processed jobs, and a job's processing time depended on its position in a sequence. The objective functions include total earliness, the weighted number of tardy jobs and the cost of due date assignment. We analyzed these problems with two different due date assignment methods and conclude that the problems are polynomial time solvable.

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