Simple temporal problems represent a powerful class of models capable of
describing the temporal relations between events that arise in many real-world
applications such as logistics, robot planning and management systems. The
classic simple temporal problem permits each event to have only a single
release and due date. In this paper, we focus on the case where events may have
an arbitrarily large number of release and due dates. This type of problem,
however, has been referred to by various names. In order to simplify and
standardize nomenclatures, we introduce the name Simple Disjunctive Temporal
Problem. We provide three mathematical models to describe this problem using
constraint programming and linear programming. To efficiently solve simple
disjunctive temporal problems, we design two new algorithms inspired by
previous research, both of which exploit the problem's structure to
significantly reduce their space complexity. Additionally, we implement
algorithms from the literature and provide the first in-depth empirical study
comparing methods to solve simple disjunctive temporal problems across a wide
range of experiments. Our analysis and conclusions offer guidance for future
researchers and practitioners when tackling similar temporal constraint
problems in new applications. All results, source code and instances are made
publicly available to further assist future research.

该研究介绍了一种称为简单分离时态问题的时空约束问题，并提出了三个数学模型来解决。同时，设计了两个新算法来高效地解决该问题，并与现有算法进行了实验比较。该研究为类似时空约束问题的解决提供了指导。