Preemptive scheduling of interval orders is polynomial

DOI10.1007/BF00353653zbMath0699.68049MaRDI QIDQ913500

M. G. Stone, Norbert W. Sauer

Publication date: 1989

Published in: Order (Search for Journal in Brave)

zbMATH Keywords

schedulingpolynomial time algorithm

Mathematics Subject Classification ID

Partial orders, general (06A06) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (8)

A survey on how the structure of precedence constraints may change the complexity class of scheduling problems ⋮ Rational preemptive scheduling ⋮ Unnamed Item ⋮ Optimal preemptive scheduling on a fixed number of identical parallel machines ⋮ Polyhedral Reformulation of a Scheduling Problem And Related Theoretical Results ⋮ Preemptive scheduling and antichain polyhedra ⋮ A polynomial algorithm for recognizing the \(\mathcal A\)-order class ⋮ Review of properties of different precedence graphs for scheduling problems

Cites Work

• Rational preemptive scheduling
• Scheduling Interval-Ordered Tasks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Preemptive scheduling of interval orders is polynomial