Online scheduling with general machine cost functions

DOI10.1016/j.dam.2007.10.014zbMath1164.90013OpenAlexW2004761247MaRDI QIDQ1026108

Csanád Imreh

Publication date: 24 June 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2007.10.014

zbMATH Keywords

schedulingcompetitive analysisonline algorithms

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

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 ⋮ New upper and lower bounds for online scheduling with machine cost ⋮ Online Scheduling with Machine Cost and a Quadratic Objective Function ⋮ On the on-line maintenance scheduling problem ⋮ Uniform parallel machine scheduling problems with fixed machine cost ⋮ Scheduling games on uniform machines with activation cost

Cites Work

• Scheduling problems on two sets of identical machines
• Semi-online scheduling with machine cost.
• Preemptive online algorithms for scheduling with machine cost
• Scheduling with machine cost and rejection
• Online scheduling with machine cost and rejection
• A guessing game and randomized online algorithms
• Bounds for List Schedules on Uniform Processors
• On-line routing of virtual circuits with applications to load balancing and machine scheduling
• Better Online Algorithms for Scheduling with Machine Cost
• On-Line Load Balancing for Related Machines
• Bounds for Certain Multiprocessing Anomalies
• Unnamed Item
• Unnamed Item
• Unnamed Item