Semi-on-line scheduling on two parallel processors with an upper bound on the items
From MaRDI portal
Publication:1762979
DOI10.1007/s00453-003-1037-2zbMath1082.90034OpenAlexW2089938457MaRDI QIDQ1762979
Zsolt Tuza, Enrico Angelelli, 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
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Deterministic scheduling theory in operations research (90B35) Parallel algorithms in computer science (68W10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
A survey on makespan minimization in semi-online environments, Online makespan minimization with parallel schedules, Optimal preemptive semi-online scheduling on two uniform processors, Semi on-line scheduling on three processors with known sum of the tasks, Semi-online scheduling: a survey, Semi-online scheduling problems on two identical machines with inexact partial information, Semi-online scheduling revisited, Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling, Semi-online scheduling on two uniform processors, An optimal online algorithm for two-machine open shop preemptive scheduling with bounded processing times, An improved parametric algorithm on two-machine scheduling with given lower and upper bounds for the total processing time
Cites Work
