Skip to main content
SpringerLink
Log in

Constraint-Based Modeling and Scheduling of Clinical Pathways

  • Conference paper
Recent Advances in Constraints (CSCLP 2009)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6384))

Abstract

In this article a constraint-based modeling of clinical pathways, in particular of surgical pathways, is introduced and used for an optimized scheduling of their tasks. The addressed optimization criteria are based on practical experiences in the area of Constraint Programming applications in medical work flow management. Objective functions having empirical evidence for their adequacy in the considered use cases are formally presented. It is shown how they are respected while scheduling clinical pathways.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aggoun, A., Beldiceanu, N.: Extending CHIP in order to solve complex scheduling and placement problems. Journal of Mathematical and Computer Modelling 17(7), 57–73 (1993)

    Article  Google Scholar 

  2. Allen, J.F.: Maintaining knowledge about temporal intervals. Communications of the ACM 26(1), 832–843 (1983)

    Article  MATH  Google Scholar 

  3. Baptiste, P., le Pape, C., Nuijten, W.: Constraint-Based Scheduling: Applying Constraint Programming to Scheduling Problems. International Series in Operations Research & Management Science, vol. 39. Kluwer Academic Publishers, Dordrecht (2001)

    MATH  Google Scholar 

  4. Beldiceanu, N., Carlsson, M.: A new multi-resource cumulatives constraint with negative heights. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 63–79. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  5. Belien, J., Demeulemeestera, E.: A branch-and-price approach for integrating nurse and surgery scheduling. European Journal of Operational Research 189(3), 652–668 (2008)

    Article  MATH  Google Scholar 

  6. Bouquard, J.-L., Lenté, C.: Equivalence to the sequence dependent setup time problem. In: Frank, J., Sabin, M. (eds.) CP 1998 Workshop on Constraint Problem Reformulation (October 30, 1998), http://ti.arc.nasa.gov/ic/people/frank/bouquard.cp98.FINAL.ps (last visited: 2008/08/14)

  7. Burke, E.K., De Causmaecker, P., Vanden Berghe, G., Van Landeghem, H.: The state of the art of nurse rostering. The Journal of Scheduling 7(6), 441–499 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  8. Dechter, R., Meiri, I., Pearl, J.: Temporal constraint networks. Artificial Intelligence 49(1-3), 61–95 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  9. Gagné, C., Price, W.L., Gravel, M.: Scheduling a single machine with sequence dependent setup time using ant colony optimization. Technical Report 2001-003, Faculté des Sciences de L’Administration, Université Laval, Québec, Canada (April 2001)

    Google Scholar 

  10. Hannebauer, M., Müller, S.: Distributed constraint optimization for medical appointment scheduling. In: Proceedings of the Fifth International Conference on Autonomous Agents, AGENTS 2001, pp. 139–140. ACM, New York (2001)

    Chapter  Google Scholar 

  11. Hoche, M., Müller, H., Schlenker, H., Wolf, A.: firstCS - A Pure Java Constraint Programming Engine. In: Hanus, M., Hofstedt, P., Wolf, A. (eds.) 2nd International Workshop on Multiparadigm Constraint Programming Languages – MultiCPL 2003 (September 29, 2003), http://uebb.cs.tu-berlin.de/MultiCPL03/Proceedings.MultiCPL03.RCoRP03.pdf (last visited: 2009/05/13)

  12. Hofstedt, P., Wolf, A.: Einführung in die Constraint-Programmierung, eXamen.press. Springer, Heidelberg (2007) ISBN 978-3-540-23184-4

    MATH  Google Scholar 

  13. Kuhnert, S.: Efficient edge-finding on unary resources with optional activities. In: Seipel, D., Hanus, M., Wolf, A., Baumeister, J. (eds.) Proceedings of the 17th Conference on Applications of Declarative Programming and Knowledge Management (INAP 2007) and 21st Workshop on (Constraint) Logic Programming (WLP 2007), Institut für Informatik, Am Hubland, 97074 Würzburg, Germany. Technical Report, vol. 434, pp. 35–46. Bayerische Julius-Maximilians-Universität Würzburg (October 2007)

    Google Scholar 

  14. Laborie, P.: Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results. Artifical Intelligence 143, 151–188 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  15. Neumann, K., Schwindt, C.: Project scheduling with inventory constraints. Mathematical Methods of Operations Research 56, 513–533 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  16. Rousseau, L.-M., Pesant, G., Gendreau, M.: A general approach to the physician rostering problem. Annals of Operations Research 115(1), 193–205 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  17. Schlenker, H., Goltz, H.-J., Oestmann, J.-W.: Tame. In: Quaglini, S., Barahona, P., Andreassen, S. (eds.) AIME 2001. LNCS (LNAI), vol. 2101, pp. 395–404. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  18. Schulte, C., Stuckey, P.J.: When do bounds and domain propagation lead to the same search space. In: Sørgaard, H. (ed.) Third International Conference on Principles and Practice of Declarative Programming, Florence, Italy, pp. 115–126. ACM Press, New York (September 2001)

    Google Scholar 

  19. Simonis, H., Cornelissens, T.: Modelling producer/consumer constraints. In: Montanari, U., Rossi, F. (eds.) CP 1995. LNCS, vol. 976, pp. 449–462. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  20. Trajan, R.E., van Leeuwen, J.: Worst-case analysis of set union algortihms. Journal of the ACM 31(2), 245–281 (1984)

    Article  Google Scholar 

  21. Vilím, P., Barták, R., Čepek, O.: Unary resource constraint with optional activities. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 62–76. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  22. Wolf, A.: Reduce-to-the-opt – a specialized search algorithm for contiguous task scheduling. In: Apt, K.R., Fages, F., Rossi, F., Szeredi, P., Váncza, J. (eds.) CSCLP 2003. LNCS (LNAI), vol. 3010, pp. 223–232. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  23. Wolf, A.: Object-oriented constraint programming in Java using the library firstCS. In: Fink, M., Tompits, H., Woltran, S. (eds.) 20th Workshop on Logic Programming, Vienna, Austria, February 22-24. INFSYS Research Report, vol. 1843-06-02, pp. 21–32. Technische Universität Wien (2006)

    Google Scholar 

  24. Wolf, A.: Constraint-based task scheduling with sequence dependent setup times, time windows and breaks. In: Im Fokus das Leben, INFORMATIK 2009. Lecture Notes in Informatics (LNI) - Proceedings Series of the Gesellschaft für Informatik (GI), vol. 154, pp. 3205–3219. Gesellschaft für Informatik e.V (2009)

    Google Scholar 

  25. Wolf, A., Schlenker, H.: Realizing the alternative resources constraint. In: Seipel, D., Hanus, M., Geske, U., Bartenstein, O. (eds.) INAP/WLP 2004. LNCS (LNAI), vol. 3392, pp. 185–199. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  26. Wolf, A., Schrader, G.: Linear weighted-task-sum – scheduling prioritised tasks on a single resource. In: Seipel, D., Hanus, M., Wolf, A. (eds.) INAP 2007. LNCS (LNAI), vol. 5437, pp. 21–37. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fraunhofer FIRST, Kekuléstr. 7, D-12489, Berlin, Germany

    Armin Wolf

Authors
  1. Armin Wolf
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Software, Technical University of Catalonia, C. Jordi Girona 1-3, 08034, Barcelona, Spain

    Javier Larrosa

  2. Cork Constraint Computation Centre, University College Cork, Western Road, Corcaigh, Co., Cork, Ireland

    Barry O’Sullivan

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wolf, A. (2011). Constraint-Based Modeling and Scheduling of Clinical Pathways. In: Larrosa, J., O’Sullivan, B. (eds) Recent Advances in Constraints. CSCLP 2009. Lecture Notes in Computer Science(), vol 6384. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19486-3_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-19486-3_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-19485-6

  • Online ISBN: 978-3-642-19486-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation