Semi-online scheduling with machine cost.

DOI10.1007/BF02960768zbMath1070.90518OpenAlexW2008793458MaRDI QIDQ1433957

Yong He, Sheng-Yi Cai

Publication date: 1 July 2004

Published in: Journal of Computer Science and Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02960768

zbMATH Keywords

schedulingcompetitive ratioanalysis of algorithmsemi-onlinemachine cost

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

Competitive ratios for preemptive and non-preemptive online scheduling with nondecreasing concave machine cost ⋮ An optimal online algorithm for scheduling with general machine cost functions ⋮ Batching deteriorating items with applications in computer communication and reverse logistics ⋮ Semi-online scheduling: a survey ⋮ Online Scheduling with Machine Cost and a Quadratic Objective Function ⋮ Online scheduling with machine cost and rejection ⋮ Uniform parallel machine scheduling problems with fixed machine cost ⋮ Preemptive online algorithms for scheduling with machine cost ⋮ Online scheduling with general machine cost functions ⋮ Scheduling games on uniform machines with activation cost

Cites Work

• Semi on-line algorithms for the partition problem
• Semi on-line scheduling on two identical machines
• Ordinal algorithms for parallel machine scheduling
• Semi-online scheduling with decreasing job sizes
• Semi-on-line scheduling with ordinal data on two uniform machines
• Unnamed Item