Rational preemptive scheduling

DOI10.1007/BF00337697zbMath0648.68044MaRDI QIDQ1105366

M. G. Stone, Norbert W. Sauer

Publication date: 1987

Published in: Order (Search for Journal in Brave)

zbMATH Keywords

partial orderprecedence constraintspreemptive schedulingminimum completion time scheduling

Mathematics Subject Classification ID

Partial orders, general (06A06) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (7)

Normal-form preemption sequences for an open problem in scheduling theory ⋮ Preemptive scheduling of interval orders is polynomial ⋮ Task splitting for three machine preemptive scheduling ⋮ Polyhedral Reformulation of a Scheduling Problem And Related Theoretical Results ⋮ Preemptive scheduling and antichain polyhedra ⋮ Integrality Property in Preemptive Parallel Machine Scheduling ⋮ How small are shifts required in optimal preemptive schedules?

Cites Work

• Preemptive scheduling of interval orders is polynomial
• Scheduling with Deadlines and Loss Functions
• Scheduling Interval-Ordered Tasks
• Optimal Preemptive Scheduling on Two-Processor Systems
• Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Rational preemptive scheduling