Scheduling with target times

DOI10.1007/BF01307051zbMath0482.90050MaRDI QIDQ3941174

Vadim G. Vizing

Publication date: 1981

Published in: Cybernetics (Search for Journal in Brave)

zbMATH Keywords

NP-completenesssufficient existence conditionsexistence of a feasible schedulen tasksm unrelated machinestarget times

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Some simple scheduling algorithms
• Unnamed Item

This page was built for publication: Scheduling with target times