Optimal Scheduling on Parallel Processors with Precedence Constraints and General Costs

DOI10.1017/S0269964800004691MaRDI QIDQ5488537zbMATH OpenFDO

Authors Zhen Liu, Rhonda Righter

Publication date 22 September 2006

Published in Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Recommendations

• Stochastic Scheduling with Variable Profile and Precedence Constraints
• Optimal Scheduling of Jobs with Exponential Service Times on Identical Parallel Processors
• On the Optimal Stochastic Scheduling of Out-Forests
• On Stochastic Scheduling with In-Tree Precedence Constraints
• Rational preemptive scheduling

Cites work

• A Stochastic Scheduling Problem with Intree Precedence Constraints
• On Stochastic Scheduling with In-Tree Precedence Constraints
• On the Optimal Stochastic Scheduling of Out-Forests
• Optimal Scheduling of Exponential Tasks with In-Tree Precedence Constraints on Two Parallel Processors Subject to Failure and Repair
• Scheduling Interval-Ordered Tasks
• Scheduling Jobs with Exponentially Distributed Processing Times and Intree Precedence Constraints on Two Parallel Machines
• Stochastic Scheduling with Variable Profile and Precedence Constraints

Cited in

(11)

• scientific article; zbMATH DE number 1206104 (Why is no real title available?)
• On scheduling tasks with exponential service times and in-tree precedence constraints
• scientific article; zbMATH DE number 744095 (Why is no real title available?)
• Optimal parallel processing of random task graphs
• Scheduling parallel processors: Structural properties and optimal policies
• Resource allocation in grid computing
• On the Optimal Stochastic Scheduling of Out-Forests
• Computing optimal preemptive schedules for parallel tasks: linear programming approaches
• ILP formulations for scheduling ordered tasks on a bounded number of processors
• Optimal scheduling of progressive processing tasks
• Optimal Scheduling of Exponential Tasks with In-Tree Precedence Constraints on Two Parallel Processors Subject to Failure and Repair

This page was built for publication: Optimal Scheduling on Parallel Processors with Precedence Constraints and General Costs

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