Skip to main content
SpringerLink
Log in

A Probabilistic Approach to Reduce the Number of Deadline Violations and the Tardiness of Workflows

  • Conference paper
On the Move to Meaningful Internet Systems 2006: OTM 2006 Workshops (OTM 2006)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4277))

Abstract

Process prioritization strategies, based on a probabilistic temporal model, are applied to reduce the number of deadline violations and the tardiness of workflows.

An erratum to this chapter can be found at http://dx.doi.org/10.1007/11915034_125.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Baggio, G., Wainer, J., Ellis, C.A.: Applying Scheduling Techniques to Minimize the Number of Late Jobs in Workflow Systems. In: Proc. of the 2004 ACM Symposium on Applied Computing (SAC), ACM Press, New York (2004)

    Google Scholar 

  2. Eder, J., Gruber, W., Ninaus, M., Pichler, H.: Personal Scheduling for Workflow Systems. In: van der Aalst, W.M.P., ter Hofstede, A.H.M., Weske, M. (eds.) BPM 2003. LNCS, vol. 2678, Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  3. Eder, J., Pichler, H.: Duration Histograms for Workflow Systems. In: Proc. of the Conf. on Engineering Information Systems in the Internet Context, Kluwer Academic, Dordrecht (2002)

    Google Scholar 

  4. Eder, J., Pichler, H.: Probabilistic Workflow Management. Technical report, Universität Klagenfurt, Institut für Informatik Systeme (2005)

    Google Scholar 

  5. Rhee, S., Bae, H., Kim, Y.: A Dispatching Rule for Efficient Workflow. Concurrent Engineering, vol. 12. Sage Publications, Thousand Oaks (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Vienna, Austria

    Johann Eder

  2. University of Klagenfurt, Austria

    Hannes Eichner & Horst Pichler

Authors
  1. Johann Eder
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hannes Eichner
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Horst Pichler
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. STARLab, Vrije Universiteit Brussel (VUB), Bldg G/10, Pleinlaan 2, 1050, Brussels, Belgium

    Robert Meersman

  2. School of Computer Science and Information Technology, RMIT University, Bld 10.10, 376-392 Swanston Street, 3001, Melbourne, VIC, Australia

    Zahir Tari

  3. Facultad de Informática, Universidad Politécnica de Madrid, Campus de Montegancedo S/N, 28660, Boadilla del Monte, Madrid, Spain

    Pilar Herrero

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Eder, J., Eichner, H., Pichler, H. (2006). A Probabilistic Approach to Reduce the Number of Deadline Violations and the Tardiness of Workflows. In: Meersman, R., Tari, Z., Herrero, P. (eds) On the Move to Meaningful Internet Systems 2006: OTM 2006 Workshops. OTM 2006. Lecture Notes in Computer Science, vol 4277. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11915034_3

Download citation

  • DOI: https://doi.org/10.1007/11915034_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-48269-7

  • Online ISBN: 978-3-540-48272-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation