Better Online Algorithms for Scheduling with Machine Cost
From MaRDI portal
Publication:4651504
DOI10.1137/S009753970343395XzbMath1112.90020OpenAlexW2076433109MaRDI QIDQ4651504
Publication date: 21 February 2005
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s009753970343395x
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
Related Items
Fast approximation algorithms for bi-criteria scheduling with machine assignment costs ⋮ Competitive ratios for preemptive and non-preemptive online scheduling with nondecreasing concave machine cost ⋮ Scheduling with machine cost and rejection ⋮ Competitive analysis of online machine rental and online parallel machine scheduling problems with workload fence ⋮ Competitive algorithm for scheduling of sharing machines with rental discount ⋮ An optimal online algorithm for scheduling with general machine cost functions ⋮ Batching deteriorating items with applications in computer communication and reverse logistics ⋮ Online algorithms for scheduling with machine activation cost on two uniform machines ⋮ The generalization of scheduling with machine cost ⋮ Inefficiency analysis of the scheduling game on limited identical machines with activation costs ⋮ New upper and lower bounds for online scheduling with machine cost ⋮ Online Scheduling with Machine Cost and a Quadratic Objective Function ⋮ Online scheduling with machine cost and rejection ⋮ Preemptive online algorithms for scheduling with machine cost ⋮ Online scheduling with general machine cost functions ⋮ Scheduling games on uniform machines with activation cost ⋮ ONLINE ALGORITHMS FOR SCHEDULING WITH MACHINE ACTIVATION COST
