Preemptive online algorithms for scheduling with machine cost

DOI10.1007/S00236-004-0156-9MaRDI QIDQ1777224zbMATH OpenOpenAlexFDO

Authors Yiwei Jiang, Yong He

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

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Better Online Algorithms for Scheduling with Machine Cost
• Semi-online scheduling with machine cost.
• An optimal online algorithm for scheduling with general machine cost functions
• New upper and lower bounds for online scheduling with machine cost
• Online scheduling with general machine cost functions

Cites work

• A guessing game and randomized online algorithms
• An optimal algorithm for preemptive on-line scheduling
• Better Online Algorithms for Scheduling with Machine Cost
• Bin stretching revisited
• Bounds on Multiprocessing Timing Anomalies
• scientific article; zbMATH DE number 1418274 (Why is no real title available?)
• Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines
• Semi on-line algorithms for the partition problem
• Semi on-line scheduling on two identical machines
• Semi-online algorithms for parallel machine scheduling problems
• Semi-online scheduling with machine cost.

Cited in

(15)

• Online scheduling with general machine cost functions
• Online real-time preemptive scheduling of jobs with deadlines on multiple machines
• Semi-online scheduling with machine cost.
• An optimal online algorithm for scheduling with general machine cost functions
• Scheduling games on uniform machines with activation cost
• Scheduling with machine cost and rejection
• Online scheduling with machine cost and rejection
• Competitive ratios for preemptive and non-preemptive online scheduling with nondecreasing concave machine cost
• ONLINE ALGORITHMS FOR SCHEDULING WITH MACHINE ACTIVATION COST
• The generalization of scheduling with machine cost
• New upper and lower bounds for online scheduling with machine cost
• Better Online Algorithms for Scheduling with Machine Cost
• Uniform parallel machine scheduling problems with fixed machine cost
• Batching deteriorating items with applications in computer communication and reverse logistics
• Online algorithms for scheduling with machine activation cost on two uniform machines

This page was built for publication: Preemptive online algorithms for scheduling with machine cost

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1777224)