New upper and lower bounds for online scheduling with machine cost

DOI10.1016/J.DISOPT.2010.02.005zbMATH Open1241.90046OpenAlexW1988286942MaRDI QIDQ429648FDOQ429648

Authors: 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

Recommendations

• Better Online Algorithms for Scheduling with Machine Cost
• An optimal online algorithm for scheduling with general machine cost functions
• Online scheduling with general machine cost functions
• Online scheduling with machine cost and a quadratic objective function
• Publication:4941834

zbMATH Keywords

onlineschedulingcompetitive ratio

Mathematics Subject Classification ID

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

Cites Work

• On-line scheduling revisited
• Bounds for Certain Multiprocessing Anomalies
• Scheduling with machine cost and rejection
• Better Online Algorithms for Scheduling with Machine Cost
• Title not available (Why is that?)
• Online scheduling with general machine cost functions
• Preemptive online algorithms for scheduling with machine cost
• Online scheduling with machine cost and rejection
• Improved Bounds for the Online Scheduling Problem
• On randomized online scheduling

Cited In (17)

• The generalization of scheduling with machine cost
• ONLINE ALGORITHMS FOR SCHEDULING WITH MACHINE ACTIVATION COST
• Uniform parallel machine scheduling problems with fixed machine cost
• Competitive design and analysis for machine-minimizing job scheduling problem
• An \(\mathcal{O}(\log m)\)-competitive algorithm for online machine minimization
• Better Online Algorithms for Scheduling with Machine Cost
• Title not available (Why is that?)
• Preemptive online algorithms for scheduling with machine cost
• An \(\mathcal O(\log m)\)-competitive algorithm for online machine minimization
• An optimal online algorithm for scheduling with general machine cost functions
• Online algorithms for scheduling with machine activation cost on two uniform machines
• Inefficiency analysis of the scheduling game on limited identical machines with activation costs
• 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
• Competitive ratios for preemptive and non-preemptive online scheduling with nondecreasing concave machine cost
• Online scheduling with machine cost and a quadratic objective function
• Scheduling games on uniform machines with activation cost

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

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