A note on on-line scheduling with partial information

DOI10.1016/S0898-1221(02)00168-2zbMath1067.90052MaRDI QIDQ1886493

Deshi Ye, Guo-Chuan Zhang

Publication date: 18 November 2004

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

zbMATH Keywords

Competitive analysisOn-line algorithmMachine scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

A survey on makespan minimization in semi-online environments ⋮ Semi-online scheduling: a survey ⋮ Optimal semi-online algorithms for scheduling problems with reassignment on two identical machines ⋮ Exploiting incomplete information to manage multiprocessor tasks with variable arrival rates ⋮ Semi-online scheduling with ``end of sequence information ⋮ Semi-online preemptive scheduling: one algorithm for all variants ⋮ Online scheduling with a buffer on related machines ⋮ Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs ⋮ Semi-on-line problems on two identical machines with combined partial information

Cites Work

• Unnamed Item
• A simple semi on-line algorithm for \(\mathrm{P}2//C_{\max}\) with a buffer
• Online algorithms. The state of the art
• Semi on-line algorithms for the partition problem
• Semi on-line scheduling on two identical machines
• Bounds for Certain Multiprocessing Anomalies