scientific article; zbMATH DE number 176752

MaRDI QIDQ4036582zbMATH OpenFDO

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

Publication date 18 May 1993

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)

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

Cited in

(11)

• An efficient deterministic parallel algorithm for two processors precedence constraint scheduling
• An NC algorithm for finding a minimum weighted completion time schedule on series parallel graphs
• Scheduling Graphs on Two Processors
• scientific article; zbMATH DE number 4113979 (Why is no real title available?)
• Two Processor Scheduling is in $\mathcal{NC}$
• scientific article; zbMATH DE number 3963191 (Why is no real title available?)
• The Two-Processor Scheduling Problem is in Random NC
• Analysis of the list scheduling algorithm for precedence constrained parallel tasks
• Fast parallel heuristics for the job shop scheduling problem
• scientific article; zbMATH DE number 4147494 (Why is no real title available?)
• An efficient parallel algorithm for scheduling interval ordered tasks

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)