Semi-on-line scheduling with ordinal data on two uniform machines

Operations Research Letters

Volumn 28, Issue 5, 2001, Pages 221-231

  Tan, Zhiyi ^a   He, Yong ^a  

^a ZHEJIANG UNIVERSITY   (China)

Author keywords

Analysis of algorithm; Competitive ratio; Makespan; Online; Scheduling; Uniform machines

Indexed keywords

ALGORITHMS; FUNCTIONS; PIECEWISE LINEAR TECHNIQUES; PROCESS ENGINEERING; PRODUCTION CONTROL; RESOURCE ALLOCATION; SCHEDULING; STRATEGIC PLANNING;

SEMI-ONLINE SCHEDULING;

OPERATIONS RESEARCH;

EID: 0035363078     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(01)00071-2     Document Type: Article

References (12)

1. Online bin stretching
2. Bounds for list scheduling on uniform processors
3. Randomized online scheduling on two uniform machines
4. Semi on-line scheduling problem for maximizing the minimum machine completion time
5. Semi online scheduling on two identical machines
6. Semi online algorithms for the partition problem
7. Bin packing using semi-ordinal data
8. Ordinal algorithms for parallel machine scheduling
9. Amortized efficiency of list update and paging rules