Competitive ratios for preemptive and non-preemptive online scheduling with nondecreasing concave machine cost

DOI10.1016/j.ins.2013.08.041zbMath1339.90142OpenAlexW2161858439MaRDI QIDQ2629987

Yuqing Zhu, Yiwei Jiang, Longcheng Liu, Jueliang Hu, Cheng, T. C. Edwin

Publication date: 8 July 2016

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2013.08.041

zbMATH Keywords

schedulingcompetitive ratioonline algorithmconcave functionmachine cost

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)

Related Items (2)

Competitive algorithm for scheduling of sharing machines with rental discount ⋮ An optimal online algorithm for scheduling with general machine cost functions

Cites Work

• Unnamed Item
• Unnamed Item
• New upper and lower bounds for online scheduling with machine cost
• Online scheduling with general machine cost functions
• 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
• Parallel machine scheduling problems considering regular measures of performance and machine cost
• Better Online Algorithms for Scheduling with Machine Cost

This page was built for publication: Competitive ratios for preemptive and non-preemptive online scheduling with nondecreasing concave machine cost