Semi-online scheduling problems on two identical machines with inexact partial information

DOI10.1016/J.TCS.2007.02.014zbMath1117.68017OpenAlexW1990558625MaRDI QIDQ884466

Zhiyi Tan, Yong He

Publication date: 6 June 2007

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

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

zbMATH Keywords

schedulingcompetitive analysisanalysis of algorithmsemi-onlinedisturbance parameter

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (6)

A survey on makespan minimization in semi-online environments ⋮ Semi-online scheduling: a survey ⋮ Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information ⋮ Semi-online preemptive scheduling: one algorithm for all variants ⋮ Semi-online scheduling with known partial information about job sizes on two identical machines ⋮ An improved parametric algorithm on two-machine scheduling with given lower and upper bounds for the total processing time

Cites Work

• Unnamed Item
• Unnamed Item
• Semi-on-line multiprocessor scheduling with given total processing time
• Semi on-line algorithms for the partition problem
• Semi on-line scheduling on two identical machines
• Bin stretching revisited
• Semi-on-line scheduling on two parallel processors with an upper bound on the items
• Semi-on-line problems on two identical machines with combined partial information
• Semi-online algorithms for parallel machine scheduling problems
• The on-line multiprocessor scheduling problem with known sum of the tasks
• Bounds for Certain Multiprocessing Anomalies
• Semi-online scheduling with decreasing job sizes
• On-line bin-stretching

This page was built for publication: Semi-online scheduling problems on two identical machines with inexact partial information