scientific article; zbMATH DE number 176752

zbMATH Open0769.68007MaRDI QIDQ4036582FDOQ4036582

Authors: Hermann Jung, Maria Serna, P. G. Spirakis 

Publication date: 18 May 1993

Title of this publication is not available (Why is that?)

Recommendations

• An efficient deterministic parallel algorithm for two processors precedence constraint scheduling
• scientific article; zbMATH DE number 3963191
• The Two-Processor Scheduling Problem is in Random NC
• Two Processor Scheduling is in $\mathcal{NC}$
• scientific article; zbMATH DE number 1759465

zbMATH Keywords

matchingbipartite graphstwo processors scheduling

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distributed algorithms (68W15)

Cited In (11)

• Analysis of the list scheduling algorithm for precedence constrained parallel tasks
• The Two-Processor Scheduling Problem is in Random NC
• Scheduling Graphs on Two Processors
• Two Processor Scheduling is in $\mathcal{NC}$
• Title not available (Why is that?)
• An NC algorithm for finding a minimum weighted completion time schedule on series parallel graphs
• An efficient deterministic parallel algorithm for two processors precedence constraint scheduling
• An efficient parallel algorithm for scheduling interval ordered tasks
• Fast parallel heuristics for the job shop scheduling problem
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication:

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