Semi-on-line scheduling on two parallel processors with an upper bound on the items

DOI10.1007/S00453-003-1037-2MaRDI QIDQ1762979zbMATH OpenOpenAlexFDO

Authors Enrico Angelelli, Zsolt Tuza, Maria Grazia Speranza

Publication date 11 February 2005

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-003-1037-2

zbMATH Keywords

SchedulingCompetitive analysisSemi-on-lineTwo parallel processors

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Parallel algorithms in computer science (68W10)

Recommendations

• Semi on-line scheduling on two parallel processors with known sum and lower bound on the size of the tasks
• New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks
• Semi-online scheduling on two uniform processors
• On-line scheduling of parallel jobs on two machines
• Semi on-line scheduling on three processors with known sum of the tasks

Cites work

• Better Bounds for Online Scheduling

Cited in

(12)

• Semi-online scheduling revisited
• An optimal online algorithm for two-machine open shop preemptive scheduling with bounded processing times
• Semi-online scheduling problems on two identical machines with inexact partial information
• Semi on-line scheduling on three processors with known sum of the tasks
• A survey on makespan minimization in semi-online environments
• Semi-online scheduling on two uniform processors
• An improved parametric algorithm on two-machine scheduling with given lower and upper bounds for the total processing time
• New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks
• Optimal preemptive semi-online scheduling on two uniform processors
• Semi-online scheduling: a survey
• Semi on-line scheduling on two parallel processors with known sum and lower bound on the size of the tasks
• Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling

This page was built for publication: Semi-on-line scheduling on two parallel processors with an upper bound on the items

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