Time-Dependent Simple Temporal Networks: Properties and Algorithms


  • Cédric Pralet ONERA
  • Gérard Verfaillie ONERA




simple temporal networks, time-dependent scheduling


Simple Temporal Networks (STNs) allow minimum and maximum distance constraints between time-points to be represented. They are often used when tackling planning and scheduling problems that involve temporal aspects. This paper is a summary of the journal article "Time-dependent Simple Temporal Networks: Properties and Algorithms" published in RAIRO - Operations Research. This journal article introduces an extension of STN called Time-dependent STN (TSTN), which covers temporal constraints for which the temporal distance required between two time-points is not necessarily constant. Such constraints are useful to model time-dependent scheduling problems, in which the duration of an activity may depend on its starting time. The paper introduces the TSTN framework, its properties, resolution techniques, as well as examples of applications.




How to Cite

Pralet, C., & Verfaillie, G. (2014). Time-Dependent Simple Temporal Networks: Properties and Algorithms. Proceedings of the International Conference on Automated Planning and Scheduling, 24(1), 536-539. https://doi.org/10.1609/icaps.v24i1.13656