Two semi-online scheduling problems on two uniform machines

DOI10.1016/J.TCS.2008.11.018zbMath1162.90013OpenAlexW2076209012MaRDI QIDQ1006050

J. Martínez

Publication date: 17 March 2009

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

Full work available at URL: http://hdl.handle.net/10397/1268

zbMATH Keywords

schedulingcompetitive ratioanalysis of algorithmsemi-online

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35)

Related Items (11)

A survey on makespan minimization in semi-online environments ⋮ Tight upper bounds for semi-online scheduling on two uniform machines with known optimum ⋮ Semi-online scheduling with bounded job sizes on two uniform machines ⋮ Semi-online scheduling: a survey ⋮ Semi-online scheduling problems on two uniform machines under a grade of service provision ⋮ Semi-online early work maximization problems on two hierarchical uniform machines with partial information of processing time ⋮ Dynamic scheduling of patients in emergency departments ⋮ 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 ⋮ Online bin stretching with bunch techniques ⋮ Tight lower bounds for semi-online scheduling on two uniform machines with known optimum

Cites Work

• Unnamed Item
• Semi-on-line multiprocessor scheduling with given total processing time
• A linear compound algorithm for uniform machine scheduling
• Semi on-line algorithms for the partition problem
• Bin stretching revisited
• Semi-on-line problems on two identical machines with combined partial information
• The on-line multiprocessor scheduling problem with known sum of the tasks
• On-line bin-stretching

This page was built for publication: Two semi-online scheduling problems on two uniform machines