Artificial Intelligence - Special issue on knowledge representation
Generating feasible schedules under complex metric constraints
AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
The Amulet Environment: New Models for Effective User Interface Software Development
IEEE Transactions on Software Engineering
Constraint-Based Job Shop Scheduling with {\sc Ilog\ Scheduler}
Journal of Heuristics
Graph Layout through the VCG Tool
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
Gaining efficiency and flexibility in the simple temporal problem
TIME '96 Proceedings of the 3rd Workshop on Temporal Representation and Reasoning (TIME'96)
The design and experimental analysis of algorithms for temporal reasoning
Journal of Artificial Intelligence Research
An iterative sampling procedure for resource constrained project scheduling ith time windows
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
Hi-index | 0.00 |
This paper describes a system, named TimeNetManager or TNM, that generates and manipulates random constraint networks corresponding to the so called Simple Temporal Problem (STP). The software tool satisfies both the requirements to build some common benchmarks useful to compare different research results, and to create a tool for supporting intensive test of new algorithms for temporal constraints management. The paper gives an overview of the functionalities of the software system and describes in detail the random generator able to fast generate sets of temporal networks controlled by a set of macro-parameters that characterize the topology and the temporal flexibility of the networks.