Preemptive online algorithms for scheduling with machine cost
From MaRDI portal
Publication:1777224
DOI10.1007/S00236-004-0156-9zbMath1143.90335OpenAlexW2092031801MaRDI QIDQ1777224
Publication date: 12 May 2005
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-004-0156-9
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (12)
Competitive ratios for preemptive and non-preemptive online scheduling with nondecreasing concave machine cost ⋮ Scheduling with machine cost and rejection ⋮ 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 ⋮ New upper and lower bounds for online scheduling with machine cost ⋮ Online scheduling with machine cost and rejection ⋮ Uniform parallel machine scheduling problems with fixed 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
Cites Work
- Unnamed Item
- Semi on-line algorithms for the partition problem
- Semi on-line scheduling on two identical machines
- Bin stretching revisited
- Semi-online scheduling with machine cost.
- Semi-online algorithms for parallel machine scheduling problems
- Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines
- An optimal algorithm for preemptive on-line scheduling
- A guessing game and randomized online algorithms
- Better Online Algorithms for Scheduling with Machine Cost
- Bounds on Multiprocessing Timing Anomalies
This page was built for publication: Preemptive online algorithms for scheduling with machine cost
