The complexity of short schedules for uet bipartite graphs

DOI10.1051/RO:1999115MaRDI QIDQ4497865zbMATH OpenOpenAlexFDO

Authors 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, https://semanticscholar.org/paper/d01fa5aaf0e75decdfd5d6d9c751bbcfb64900c2

zbMATH Keywords

complexitybipartite graphmultiprocessorschedulemultiprocessor scheduling problem

Mathematics Subject Classification ID

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

Recommendations

• The complexity of ultrametric partitions on graphs
• On the complexity of construction of complete and complete bipartite graphs
• The complexity of contracting bipartite graphs into small cycles
• Bipartite regular graphs and shortness parameters
• Complexity of a disjoint matching problem on bipartite graphs
• On the sensitivity complexity of bipartite graph properties
• Short solution of Kotzig's problem for bipartite graphs
• scientific article; zbMATH DE number 3917707
• On Short Cycle Enumeration in Biregular Bipartite Graphs

Cited in

(2)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4497865)