Semi-online scheduling problems on two uniform machines under a grade of service provision

DOI10.1016/J.TCS.2013.04.013zbMath1294.90026OpenAlexW2086788249MaRDI QIDQ388114

Xinrong Lu, Zhaohui Liu

Publication date: 19 December 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.04.013

zbMATH Keywords

schedulingcompetitive ratiograde of servicesemi-onlineuniform machine

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (5)

Semi-online scheduling: a survey ⋮ Semi-online scheduling with two GoS levels and unit processing time ⋮ Semi-online early work maximization problems on two hierarchical uniform machines with partial information of processing time ⋮ Online scheduling on two parallel identical machines under a grade of service provision ⋮ On the optimality of the LP-based algorithm for online scheduling with GoS eligibility constraints

Cites Work

• Semi-online scheduling on two uniform machines with the known largest size
• Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling
• A note on hierarchical scheduling on two uniform machines
• Semi-online scheduling with known maximum job size on two uniform machines
• Online and semi-online scheduling of two machines under a grade of service provision
• Two semi-online scheduling problems on two uniform machines
• Bin stretching revisited
• Parallel machine scheduling under a grade of service provision
• Semi-online scheduling on two uniform processors
• Optimal Semi-online Scheduling Algorithms on Two Parallel Identical Machines under a Grade of Service Provision
• Randomized on-line scheduling on two uniform machines

This page was built for publication: Semi-online scheduling problems on two uniform machines under a grade of service provision