The complexity of short schedules for uet bipartite graphs

DOI10.1051/ro:1999115zbMath0953.68019OpenAlexW2156837885MaRDI QIDQ4497865

Evripidis Bampis

Publication date: 24 August 2000

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/197782

zbMATH Keywords

complexitybipartite graphschedulemultiprocessormultiprocessor scheduling problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Maximum cost scheduling of jobs with mixed variable processing times and \(k\)-partite precedence constraints ⋮ Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay.

This page was built for publication: The complexity of short schedules for uet bipartite graphs