Semi-on-line multiprocessor scheduling with given total processing time

DOI10.1016/j.tcs.2004.11.018zbMath1087.68015MaRDI QIDQ557814

Cheng, T. C. Edwin, Hans Kellerer, Vladimir Kotov

Publication date: 30 June 2005

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

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

zbMATH Keywords

multiprocessor scheduling; on-line algorithms; approximation algorithms

Mathematics Subject Classification ID

68W40: Analysis of algorithms

90B35: Deterministic scheduling theory in operations research

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

Related Items

Online bin packing with advice, Semi-online scheduling problems on a small number of machines, Semi-online scheduling revisited, Online over time scheduling on parallel-batch machines: a survey, Online bin stretching with bunch techniques, Best semi-online algorithms for unbounded parallel batch scheduling, Semi-online machine covering on two uniform machines with known total size, Optimal semi-online algorithms for machine covering, Semi-online scheduling problems on two identical machines with inexact partial information, An efficient algorithm for semi-online multiprocessor scheduling with given total processing time, Machine covering with combined partial information, Two semi-online scheduling problems on two uniform machines, Online makespan minimization with parallel schedules, Optimal algorithms for semi-online machine covering on two hierarchical machines, An efficient algorithm for bin stretching

Cites Work

• Unnamed Item
• Unnamed Item
• Online algorithms. The state of the art
• Semi on-line algorithms for the partition problem
• Bin stretching revisited
• On-line scheduling revisited
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies
• On-line bin-stretching