Semi on-line scheduling on two parallel processors with known sum and lower bound on the size of the tasks
From MaRDI portal
Publication:5949930
zbMath0981.90018MaRDI QIDQ5949930
Publication date: 5 December 2001
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (5)
A survey on makespan minimization in semi-online environments ⋮ Semi on-line scheduling on three processors with known sum of the tasks ⋮ Semi-online scheduling: a survey ⋮ 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
This page was built for publication: Semi on-line scheduling on two parallel processors with known sum and lower bound on the size of the tasks