Skip to main content
SpringerLink
Log in

Effective scheduling of tasks under weak temporal interval constraints

  • Applications
  • Conference paper
  • First Online:
Advances in Intelligent Computing — IPMU '94 (IPMU 1994)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 945))

Abstract

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.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Allen, J. Maintaining Knowledge about Temporal Intervals. Comm. of ACM 26, 11 (1983), pp. 832–843.

    Google Scholar 

  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. 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. 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. 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. 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. Baker, K. Introduction to Sequencing and Scheduling. Wiley & Sons, New York, 1974.

    Google Scholar 

  8. Dean, T. Using Temporal Hierarchies to Efficiently Maintain Large Temporal Databases. Journal of ACM 36, (1989), pp. 687–718.

    Google Scholar 

  9. Dechter, R., Meiri, I., and Pearl, J. Temporal Constraint Networks. Artificial Intelligence Journal 49, (1991), pp. 61–95.

    Google Scholar 

  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. 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. Ladkin, P. and Reinefeld, A. Effective Solution of Qualitative Interval Constraint Problems. Artificial Intelligence 57, (1992), pp. 105–124.

    Google Scholar 

  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. 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. 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. 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. Rodriguez, R. A Relativistic Temporal Algebra for Efficient Design of Distributed Systems. Journal of Applied Intelligence 3, (1993), pp. 31–45.

    Google Scholar 

  18. Ullman, J. NP-Complete Scheduling Problems. Journal of Computer and System Sciences 10, (1975), pp. 384–393.

    Google Scholar 

  19. van Beek, P. Exact and Approximate Reasoning about Qualitative Temporal Relations. PhD Thesis, University of Alberta, 1990.

    Google Scholar 

  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. 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 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, University of W. Florida, 32514, Pensacola, FL, USA

    Frank D. Anger & Rita V. Rodriguez

Authors
  1. Frank D. Anger
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rita V. Rodriguez
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Bernadette Bouchon-Meunier Ronald R. Yager Lotfi A. Zadeh

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Anger, F.D., Rodriguez, R.V. (1995). Effective scheduling of tasks under weak temporal interval constraints. In: Bouchon-Meunier, B., Yager, R.R., Zadeh, L.A. (eds) Advances in Intelligent Computing — IPMU '94. IPMU 1994. Lecture Notes in Computer Science, vol 945. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035991

Download citation

  • DOI: https://doi.org/10.1007/BFb0035991

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-49443-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation