Skip to main content

SEaM: Analyzing Schedule Executability Through Simulation

  • Conference paper
Advances in Applied Artificial Intelligence (IEA/AIE 2006)

Abstract

Increasing attention is being dedicated to the problem of schedule execution management. This has encouraged research focused on the analysis of strategies for the execution of plans in real working environments. To this aim, much work has been recently done to devise scheduling procedures which increase the level of robustness of the produced solutions. Yet, these results represent only the first step in this direction: in order to improve confidence in the theoretical results, it is also necessary to conceive experimental frameworks where the devised measures may find confirmation through empirical testing. This approach also has the advantage of unveiling possible counter-intuitive insights of the proposed scheduling strategies, which otherwise might remain concealed. This paper presents: (a) an experimental platform designed to tackle the problem of schedule execution with uncertainty; (b) an analysis of a variety of schedule execution tests performed under variable environmental conditions.

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

Access this chapter

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Davenport, A.J., Beck, J.C.: A Survey of Techniques for Scheduling with Uncertainty (2000) (February 2006), accessible on-line at: http://tidel.mie.utoronto.ca/publications.php

  2. Aytug, H., Lawley, M.A., McKay, K.N., Mohan, S., Uzsoy, R.M.: Executing production schedules in the face of uncertainties: A review and some future directions. European Journal of Operational Research 165, 86–110 (2005)

    Article  MathSciNet  Google Scholar 

  3. Herroelen, W., Leus, R.: Robust and reactive project scheduling: a review and classification of procedures. International Journal of Production Research 42(8), 1599–1620 (2004)

    Article  Google Scholar 

  4. Verfaillie, G., Jussien, N.: Constraint solving in uncertain and dynamic environments – a survey. Constraints 10(3), 253–281 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  5. Brucker, P., Drexl, A., Mohring, R., Neumann, K., Pesch, E.: Resource-Constrained Project Scheduling: Notation, Classification, Models, and Methods. European Journal of Operational Research 112, 3–41 (1999)

    Article  MATH  Google Scholar 

  6. Bartusch, M., Mohring, R.H., Radermacher, F.J.: Scheduling project networks with resource constraints and time windows. Annals of Operations Research 16, 201–240 (1988)

    Article  MathSciNet  Google Scholar 

  7. Schoppers, M.: Universal Plans for Reactive Robots in Unpredictable Environments. In: Proceedings of the Tenth International Joint Conference on Artificial Intelligence, IJCAI 1987 (2005)

    Google Scholar 

  8. Ambros-Ingerson, J., Steel, S.: Integrating Planning, Execution and Monitoring. In: Proceedings of the Seventh National Conference on Artificial Intelligence, AAAI 1988 (1988)

    Google Scholar 

  9. Beetz, M., McDermott, D.: Improving Robot Plans During Their Execution. In: Proceedings of the Second International Conference on AI Planning Systems, AIPS 1994 (1994)

    Google Scholar 

  10. Cheng, C., Smith, S.F.: Generating Feasible Schedules under Complex Metric Constraints. In: Proceedings of the 12th National Conference on Artificial Intelligence, AAAI 1994, pp. 1086–1091. AAAI Press, Menlo Park (1994)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  12. Cesta, A., Oddi, A., Smith, S.F.: Profile Based Algorithms to Solve Multiple Capacitated Metric Scheduling Problems. In: Proceedings of the 4th International Conference on Artificial Intelligence Planning Systems, AIPS 1998, pp. 214–223. AAAI Press, Menlo Park (1998)

    Google Scholar 

  13. Cesta, A., Oddi, A., Smith, S.F.: An Iterative Sampling Procedure for Resource Constrained Project Scheduling with Time Windows. In: Proceedings of the 16th International Joint Conference on Artificial Intelligence, pp. 1022–1029. Morgan Kaufmann, San Francisco (1999)

    Google Scholar 

  14. Policella, N., Oddi, A., Smith, S.F., Cesta, A.: Generating Robust Partial Order Schedules. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 496–511. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  15. Policella, N., Rasconi, R.: Designing a Testset Generator for Reactive Scheduling. Intelligenza Artificiale (Italian Journal of Artificial Intelligence) II(3), 29–36 (2005)

    Google Scholar 

  16. Kolisch, R., Schwindt, C., Sprecher, A.: Benchmark Instances for Project Scheduling Problems. In: Weglarz, J. (ed.) Project Scheduling - Recent Models, Algorithms and Applications, pp. 197–212. Kluwer Academic Publishers, Boston (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rasconi, R., Policella, N., Cesta, A. (2006). SEaM: Analyzing Schedule Executability Through Simulation. In: Ali, M., Dapoigny, R. (eds) Advances in Applied Artificial Intelligence. IEA/AIE 2006. Lecture Notes in Computer Science(), vol 4031. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11779568_45

Download citation

  • DOI: https://doi.org/10.1007/11779568_45

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-35453-6

  • Online ISBN: 978-3-540-35454-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics