Rational preemptive scheduling

DOI10.1007/BF00337697MaRDI QIDQ1105366zbMATH OpenFDO

Authors 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)

Recommendations

• Optimal preemptive scheduling on a fixed number of identical parallel machines
• The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
• Integer preemptive scheduling on parallel machines
• Normal-form preemption sequences for an open problem in scheduling theory
• scientific article; zbMATH DE number 3883931

Cites work

• scientific article; zbMATH DE number 3957178 (Why is no real title available?)
• scientific article; zbMATH DE number 3744544 (Why is no real title available?)
• scientific article; zbMATH DE number 3780551 (Why is no real title available?)
• scientific article; zbMATH DE number 3247783 (Why is no real title available?)
• Optimal Preemptive Scheduling on Two-Processor Systems
• Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems
• Preemptive scheduling of interval orders is polynomial
• Scheduling Interval-Ordered Tasks
• Scheduling with deadlines and loss functions

Cited in

(17)

• Scheduling preemptive jobs with precedence constraints on parallel machines
• How small are shifts required in optimal preemptive schedules?
• Optimal Scheduling on Parallel Processors with Precedence Constraints and General Costs
• Preemptive scheduling of independent jobs on parallel machines subject to financial constraints
• scientific article; zbMATH DE number 2086672 (Why is no real title available?)
• How useful are preemptive schedules?
• Proof of the 4/3 conjecture for preemptive vs. nonpreemptive two-processor scheduling
• Minimizing completion time for a class of scheduling problems
• Preemptive scheduling of interval orders is polynomial
• Task splitting for three machine preemptive scheduling
• Preemptive scheduling and antichain polyhedra
• Integrality Property in Preemptive Parallel Machine Scheduling
• Polyhedral Reformulation of a Scheduling Problem And Related Theoretical Results
• Normal-form preemption sequences for an open problem in scheduling theory
• scientific article; zbMATH DE number 6157244 (Why is no real title available?)
• Pre-scheduling
• Optimal preemptive scheduling on a fixed number of identical parallel machines

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)