Optimal Scheduling on Parallel Processors with Precedence Constraints and General Costs
From MaRDI portal
Publication:5488537
DOI10.1017/S0269964800004691zbMATH Open1096.68568MaRDI QIDQ5488537FDOQ5488537
Authors: Zhen Liu, Rhonda Righter
Publication date: 22 September 2006
Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)
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
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- 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
- 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
Cited In (11)
- 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
- ILP formulations for scheduling ordered tasks on a bounded number of processors
- Scheduling parallel processors: Structural properties and optimal policies
- On the Optimal Stochastic Scheduling of Out-Forests
- Computing optimal preemptive schedules for parallel tasks: linear programming approaches
- Resource allocation in grid computing
- Title not available (Why is that?)
- On scheduling tasks with exponential service times and in-tree precedence constraints
- Optimal parallel processing of random task graphs
- Title not available (Why is that?)
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)