Rational preemptive scheduling

DOI10.1007/BF00337697zbMATH Open0648.68044MaRDI QIDQ1105366FDOQ1105366

M. G. Stone, Norbert 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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Preemptive scheduling of interval orders is polynomial

Cited In (10)

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

This page was built for publication: Rational preemptive scheduling

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