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

DOI10.1016/J.TCS.2007.02.014MaRDI QIDQ884466zbMATH OpenOpenAlexFDO

Authors 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

analysis of algorithmcompetitive analysisdisturbance parameterschedulingsemi-online

Mathematics Subject Classification ID

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

Recommendations

• Computing and Combinatorics
• Algorithms and Computation
• Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information
• Semi-online scheduling on two identical processors with two types of partial information
• Semi-online scheduling with known partial information about job sizes on two identical machines

Cites work

• Bin stretching revisited
• Bounds for Certain Multiprocessing Anomalies
• scientific article; zbMATH DE number 4130003 (Why is no real title available?)
• New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks
• On-line bin-stretching
• Semi on-line algorithms for the partition problem
• Semi on-line scheduling on two identical machines
• Semi-on-line multiprocessor scheduling with given total processing time
• Semi-on-line problems on two identical machines with combined partial information
• Semi-on-line scheduling on two parallel processors with an upper bound on the items
• Semi-online algorithms for parallel machine scheduling problems
• Semi-online scheduling with decreasing job sizes
• The on-line multiprocessor scheduling problem with known sum of the tasks

Cited in

(12)

• A survey on makespan minimization in semi-online environments
• An improved parametric algorithm on two-machine scheduling with given lower and upper bounds for the total processing time
• Semi-online early work maximization problem on two hierarchical machines with partial information of processing time
• Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information
• Semi-online scheduling: a survey
• Semi-online scheduling on two identical processors with two types of partial information
• Semi-online preemptive scheduling: one algorithm for all variants
• Coping with Incomplete Information in Scheduling — Stochastic and Online Models
• Semi-online scheduling with known partial information about job sizes on two identical machines
• Computing and Combinatorics
• Algorithms and Computation
• Tighter bounds on non-clairvoyant parallel machine scheduling with prediction to minimize makespan

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q884466)