Skip to main content
SpringerLink
Log in

An algorithm for finding D-time table

  • Regular Papers
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

In Ref. [1], we present a relation matrix description of temporal relation constraints. This paper is a sequel of [1]. Given a set of temporal relation and time duration constraints, find a time-table which satisfies all the given conditions, that is called finding a D-time table. The construction of D-time and optimal D-time table and their computational complexity are discussed.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Zhang Bo and Zhang Ling. The relation matrix approach to temporal planning.Journal of Computer Science and Technology, 1991, 6 (4).

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science and Technology, Tsinghua University, 100080, Beijing

    Bo Zhang

  2. Dept. of Mathematics, Anqing Teachers' College, 246011, Anhui

    Ling Zhang

Authors
  1. Bo Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ling Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhang, B., Zhang, L. An algorithm for finding D-time table. J. of Comput. Sci. & Technol. 7, 62–67 (1992). https://doi.org/10.1007/BF02946167

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation