The following pages link to Jiping Tao (Q336913):
Displaying 11 items.
- A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time (Q336914) (← links)
- WSPT's competitive performance for minimizing the total weighted flow time: from single to parallel machines (Q459788) (← links)
- Comments on ``Competitive analysis of a better on-line algorithm to minimize total completion time on a single-machine'' (Q625659) (← links)
- Online scheduling with linear deteriorating jobs to minimize the total weighted completion time (Q668523) (← links)
- A semi-online algorithm and its competitive analysis for a single machine scheduling problem with bounded processing times (Q974714) (← links)
- An optimal semi-online algorithm for a single machine scheduling problem with bounded processing time (Q991796) (← links)
- An improved 2.11-competitive algorithm for online scheduling on parallel machines to minimize total weighted completion time (Q1716959) (← links)
- A \(2.28\)-competitive algorithm for online scheduling on identical machines (Q2514649) (← links)
- (Q3052570) (← links)
- (Q3571184) (← links)
- A competitive online algorithm for minimizing total weighted completion time on uniform machines (Q6534502) (← links)