Using an eraser or a pencil for two-processor scheduling

DOI10.1023/A:1006070911837zbMath0912.90180OpenAlexW179793138MaRDI QIDQ1272955

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

precedence constraintstwo-processor schedulingminimality for partial orders

Mathematics Subject Classification ID

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

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