A Constraint-Based Architecture for Flexible Support to Activity Scheduling

  • Amedeo Cesta
  • Gabriella Cortellessa
  • Angelo Oddi
  • Nicola Policella
  • Angelo Susi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2175)


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.


Schedule Problem Interaction Module Activity Schedule Plan Execution Flexible Support 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [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. [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. [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. [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. [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. [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. [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.MATHCrossRefGoogle Scholar
  8. [8]
    R. Dechter, I. Meiri, and J. Pearl. Temporal constraint networks. Artificial Intelligence, 49:61–95, 1991.MATHCrossRefMathSciNetGoogle Scholar
  9. [9]
    K. Neumann and C. Schwindt. Project Scheduling with Inventory Constraints. Technical Report WIOR-572, Universität Karlsruhe, 1999.Google Scholar
  10. [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. [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. [12]
    G. Wolf. Schedule Management: An Object-Oriented Approach. Decision Support Systems, 11:373–388, 1994.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Amedeo Cesta
    • 1
  • Gabriella Cortellessa
    • 1
  • Angelo Oddi
    • 1
  • Nicola Policella
    • 1
  • Angelo Susi
    • 1
    • 2
  1. 1.IP-CNRNational Research Council of ItalyRomeItaly
  2. 2.AutomatedRea soning Systems (SRA)ITC-IRSTPovo, TrentoItaly

Personalised recommendations