Using an eraser or a pencil for two-processor scheduling

DOI10.1023/A:1006070911837MaRDI QIDQ1272955zbMATH OpenOpenAlexFDO

Authors Bernard Roux

Publication date 2 December 1998

Published in Order (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1006070911837

zbMATH Keywords

minimality for partial ordersprecedence constraintstwo-processor scheduling

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Scheduling Tree-Structured Tasks on Two Processors to Minimize Schedule Length
• Proof of the 4/3 conjecture for preemptive vs. nonpreemptive two-processor scheduling
• Scheduling Flat Graphs
• Scheduling Graphs on Two Processors

This page was built for publication: Using an eraser or a pencil for two-processor scheduling

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