Effective policies for workflow scheduling in stochastic environments

@inproceedings{Wosko2015EffectivePF,
  title={Effective policies for workflow scheduling in stochastic environments},
  author={Michal Wosko},
  year={2015}
}
There exist many realistic workflow scheduling optimization problems that have been insufficiently tackled by research or have been solved under restrictive and simplified assumptions. Most scheduling policies support only directed acyclic graphs, or even more restricted application models, with deterministic activity times. Some only allow stochastic task execution times but not inter-task communication delays, which are associated with data transfers between tasks executing on different… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 274 REFERENCES

When greediness fails: examples from stochastic scheduling

  • Oper. Res. Lett.
  • 2002
VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

Approximate dynamic programming based approach to process control and scheduling

  • Computers & Chemical Engineering
  • 2006
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Stochastic Machine Scheduling with Precedence Constraints

  • SIAM J. Comput.
  • 2002
VIEW 7 EXCERPTS
HIGHLY INFLUENTIAL

Task scheduling algorithms for heterogeneous processors

  • Proceedings. Eighth Heterogeneous Computing Workshop (HCW'99)
  • 1999
VIEW 11 EXCERPTS
HIGHLY INFLUENTIAL