Skip to main content
SpringerLink
Log in
Book cover

Congress of the Italian Association for Artificial Intelligence

AI*IA 2001: AI*IA 2001: Advances in Artificial Intelligence pp 369–381Cite as

A Constraint-Based Architecture for Flexible Support to Activity Scheduling

  • Conference paper
  • First Online:

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

Abstract

The O-OSCAR software architecture is a problem solving environment for complex scheduling problem that is based on a constraintbasedrep resentation. On top of this core representation a problem solver module and a schedule execution system guarantee a complete support to address a scheduling problem. Furthermore, a rather sophisticated interaction module allows users to maintain control on different phases of schedule management.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.C. Beck. Heuristics for Constraint-DirectedS cheduling with Inventory. In Proceedings of the Fifth Int. Conf. on Artificial Intelligence Planning and Scheduling (AIPS-00), 2000.

    Google Scholar 

  2. P. Brucker, A. Drexl, R. Mohring, K. Neumann, and E. Pesch. Resource-Constrained Project Scheduling: Notation, Classification, Models, and Methods. European Journal of Operations Research, 1998.

    Google Scholar 

  3. A. Cesta, A. Oddi, and S.F. Smith. Profile Based Algorithms to Solve Multiple CapacitatedM etric Scheduling Problems. In Proceedings of the Fourth Int. Conf. on Artificial Intelligence Planning Systems (AIPS-98), 1998.

    Google Scholar 

  4. A. Cesta, A. Oddi, and S.F. Smith. A Constrained-Based Method for Project Scheduling with Time Windows. Journal of Heuristics, 2002.

    Google Scholar 

  5. A. Cesta, A. Oddi, and A. Susi. O-OSCAR: A Flexible Object-Oriented Architecture for Schedule Management in Space Applications. In Proceedings of the Fifth Int. Symp. on Artificial Intelligence, Robotics and Automation in Space (i-SAIRAS-99), 1999.

    Google Scholar 

  6. A. Cesta and C. Stella. A Time andR esource Problem for Planning Architectures. In Proceedings of the Fourth European Conference on Planning (ECP 97), 1997.

    Google Scholar 

  7. B. De Reyck and W. Herroelen. A Branch-and-Bound Procedure for the Resource-Constrained Project Scheduling Problem with Generalized Precedence Relations. European Journal of Operations Research, 111(1):152–174, 1998.

    Article  MATH  Google Scholar 

  8. R. Dechter, I. Meiri, and J. Pearl. Temporal constraint networks. Artificial Intelligence, 49:61–95, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  9. K. Neumann and C. Schwindt. Project Scheduling with Inventory Constraints. Technical Report WIOR-572, Universität Karlsruhe, 1999.

    Google Scholar 

  10. A. Oddi and S.F. Smith. Stochastic Procedures for Generating Feasible Schedules. In Proceedings 14th National Conference on AI (AAAI-97), 1997.

    Google Scholar 

  11. N. Policella. Problemi di scheduling con risorse consumabili, risoluzione con approccio a vincoli in una architettura software orientata agli oggetti. Master’s thesis, Università di Roma “La Sapienza”, March 2001. In Italian.

    Google Scholar 

  12. G. Wolf. Schedule Management: An Object-Oriented Approach. Decision Support Systems, 11:373–388, 1994.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IP-CNR, National Research Council of Italy, Viale Marx 15, I-00137, Rome, Italy

    Amedeo Cesta, Gabriella Cortellessa, Angelo Oddi, Nicola Policella & Angelo Susi

  2. AutomatedRea soning Systems (SRA), ITC-IRST, Via Sommarive 18 - Loc. Pantè, I-38050, Povo, Trento, Italy

    Angelo Susi

Authors
  1. Amedeo Cesta
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gabriella Cortellessa
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Angelo Oddi
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Nicola Policella
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Angelo Susi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Department, University of Bari, via Orabona 4, 70125, Bari, Italy

    Floriana Esposito

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cesta, A., Cortellessa, G., Oddi, A., Policella, N., Susi, A. (2001). A Constraint-Based Architecture for Flexible Support to Activity Scheduling. In: Esposito, F. (eds) AI*IA 2001: Advances in Artificial Intelligence. AI*IA 2001. Lecture Notes in Computer Science(), vol 2175. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45411-X_39

Download citation

  • DOI: https://doi.org/10.1007/3-540-45411-X_39

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42601-1

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation