Bounds on list scheduling of UET tasks with restricted resource constraints
From MaRDI portal
Publication:1259426
DOI10.1016/0020-0190(79)90061-9zbMath0411.68037OpenAlexW2145708460MaRDI QIDQ1259426
Publication date: 1979
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(79)90061-9
Np-completebounds on list schedulingminimal-length nonpreemptive scheduletasks with restricted resource constraints
Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
Scheduling with semaphore constraints, Coffman-Graham scheduling of UET task systems with 0-1 resources, Algorithms for minimizing maximum lateness with unit length tasks and resource constraints, Approximation scheduling algorithms: a survey
Cites Work