New upper and lower bounds for online scheduling with machine cost

DOI10.1016/J.DISOPT.2010.02.005zbMath1241.90046OpenAlexW1988286942MaRDI QIDQ429648

György Dósa, Zhiyi Tan

Publication date: 20 June 2012

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2010.02.005

zbMATH Keywords

schedulingcompetitive ratioonline

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (9)

Competitive ratios for preemptive and non-preemptive online scheduling with nondecreasing concave machine cost ⋮ 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 ⋮ The generalization of scheduling with machine cost ⋮ Inefficiency analysis of the scheduling game on limited identical machines with activation costs ⋮ Online Scheduling with Machine Cost and a Quadratic Objective Function ⋮ Uniform parallel machine scheduling problems with fixed machine cost ⋮ Scheduling games on uniform machines with activation cost

Cites Work

• Unnamed Item
• Online scheduling with general machine cost functions
• On-line scheduling revisited
• Preemptive online algorithms for scheduling with machine cost
• Scheduling with machine cost and rejection
• Online scheduling with machine cost and rejection
• On randomized online scheduling
• Better Online Algorithms for Scheduling with Machine Cost
• Improved Bounds for the Online Scheduling Problem
• Bounds for Certain Multiprocessing Anomalies

This page was built for publication: New upper and lower bounds for online scheduling with machine cost