Effective scheduling of tasks under weak temporal interval constraints

  • Frank D. Anger
  • Rita V. Rodriguez
Part of the Lecture Notes in Computer Science book series (LNCS, volume 945)


Numerous AI planning applications and real-time system scheduling problems do not fit the traditional scenarios of the scheduling literature; instead, they are better expressed in terms of the temporal interval relations between the tasks. Given a set of tasks and a set of constraints expressed in terms of the atomic temporal interval relations, the problem of finding the shortest consistent schedule often arises. In the most general situation, the interval constraints leave some degree of uncertainty: the problem is under-specified. It is first shown herein that, in the completely specified case, the greatest lower bound of all schedule lengths can be calculated as the “Size” of a chain of intervals playing a role similar to that of a critical path in the familiar critical path analysis. Subsequently, a heuristic search algorithm is presented to reduce the general under-determined case to a completely specified one.

Key words

Constraint Propagation Planning Real-Time Systems Scheduling Temporal Interval Relations Temporal Reasoning 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Allen, J. Maintaining Knowledge about Temporal Intervals. Comm. of ACM 26, 11 (1983), pp. 832–843.Google Scholar
  2. [2]
    Anger, F., Hwang, J., and Chow, Y. Scheduling with Sufficient Loosely Coupled Processors. Jour. of Parallel and Distributed Computing 9, 1 (May 1990), pp. 87–92.Google Scholar
  3. [3]
    Anger, F., Rodriguez, R., and Hadlock, F. Temporal Consistency Checking of Natural Language Specifications, Applications of Artificial Intelligence III: Proceedings of SPIE 635, Orlando, FL, (Apr 1990), pp. 572–580.Google Scholar
  4. [4]
    Anger, F., Ladkin, P., and Rodriguez, R. Atomic Temporal Interval Relations in Branching Time: Calculation and Application. Applications of Artificial Intelligence IX, Proceedings of SPIE, Orlando, (Apr 1991), pp. 122–136.Google Scholar
  5. [5]
    Anger, F., Allen, J., and Rodriguez, R. Determined or Under-Determined Temporal Interval Relation Constraints: A Scheduling Strategy. UWF Technical Report CSD-TR No. 93-009, Univ. of W. Florida, Pensacola, FL, Oct 93.Google Scholar
  6. [6]
    Anger, F., Allen, J., and Rodriguez, R. Optimal and Heuristic Task Scheduling under Qualitative Temporal Constraints. Proceedings IEA/AIE-94, (Jun 1994), pp. 115–122.Google Scholar
  7. [7]
    Baker, K. Introduction to Sequencing and Scheduling. Wiley & Sons, New York, 1974.Google Scholar
  8. [8]
    Dean, T. Using Temporal Hierarchies to Efficiently Maintain Large Temporal Databases. Journal of ACM 36, (1989), pp. 687–718.Google Scholar
  9. [9]
    Dechter, R., Meiri, I., and Pearl, J. Temporal Constraint Networks. Artificial Intelligence Journal 49, (1991), pp. 61–95.Google Scholar
  10. [10]
    Freuder, E. and Hubbe, P. Using Inferred Disjunctive Constraints to Decompose Constraint Satisfaction Problems. Proceedings of the 13th IJCAI, Chambery, France, Sep 1993, pp. 254–260.Google Scholar
  11. [11]
    Ladkin, P. Satisfying First-Order Constraints about Time Intervals. Proceedings of 7th National Conf. on Artificial Intelligence, St. Paul, MN, (Aug 1988), pp. 512–517.Google Scholar
  12. [12]
    Ladkin, P. and Reinefeld, A. Effective Solution of Qualitative Interval Constraint Problems. Artificial Intelligence 57, (1992), pp. 105–124.Google Scholar
  13. [13]
    Lageweg, B., Lawler, E., Lenstra, L., and Rinnooy Kan, A. Computer Aided Complexity Classification of Deterministic Scheduling Problems. Technical Report BW 138-81, Sichting Mathematisch Centrum, Amsterdam, 1981.Google Scholar
  14. [14]
    Lawler, E., Lenstra, J., and Rinnooy Kan, A. Recent Developments in Deterministic Sequencing and Scheduling: A Survey. In Deterministic and Stochastic Scheduling, M. Dempster, et al., eds., D. Reidel Publ., Dordrecht, Holland, 1982, pp. 367–374.Google Scholar
  15. [15]
    Ligozat, G. On Generalized Interval Calculi. Proceedings of the Ninth National Conference on Artificial Intelligence, Anaheim, CA, Jul 1991, pp. 234–240.Google Scholar
  16. [16]
    Rodriguez, R. and Anger, F. Intervals in Relativistic Time. Proceedings on Information Processing and Management of Uncertainty in Knowledge-Based Systems: IPMU, Mallorca, (Jul 1992), pp. 525–529.Google Scholar
  17. [17]
    Rodriguez, R. A Relativistic Temporal Algebra for Efficient Design of Distributed Systems. Journal of Applied Intelligence 3, (1993), pp. 31–45.Google Scholar
  18. [18]
    Ullman, J. NP-Complete Scheduling Problems. Journal of Computer and System Sciences 10, (1975), pp. 384–393.Google Scholar
  19. [19]
    van Beek, P. Exact and Approximate Reasoning about Qualitative Temporal Relations. PhD Thesis, University of Alberta, 1990.Google Scholar
  20. [20]
    van Benthem, J. Time, Logic and Computation. Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, G. Goos and J. Hartmanis, eds., Springer-Verlag, New York, 1989, pp. 1–49.Google Scholar
  21. [21]
    Vilain, M., Kautz, H. Constraint Propagation Algorithms for Temporal Reasoning. Proceedings of the 5th Natl. Conf. on Artificial Intelligence, Pittsburg, PA, (Aug. 1986), pp. 377–382.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Frank D. Anger
    • 1
  • Rita V. Rodriguez
    • 1
  1. 1.Computer Science DepartmentUniversity of W. FloridaPensacolaUSA

Personalised recommendations