Minimizing a makespan under uncertainty

Authors:
Jérôme Fortin;Paweł Zielinski;Didier Dubois;Hélène Fargier
Affiliations:
UPS, IRIT, Toulouse, France;Institute of Mathematics, University of Technology, Wrocław, Poland;UPS, IRIT, Toulouse, France;UPS, IRIT, Toulouse, France
Venue:
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Year:
2005

Citing 4
Cited 0

Temporal constraint networks

Artificial Intelligence - Special issue on knowledge representation
Temporal constraint reasoning with preferences

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Dynamic control of plans with temporal uncertainty

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
On the sure criticality of tasks in activity networks withimprecise durations

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper reconsiders the most basic scheduling problem, that of minimizing the makespan of a partially ordered set of activities, in the context of incomplete knowledge. After positioning this paper in the scope of temporal networks under uncertainty, we provide a complete solution to the problem of finding floats of activities, and of locating surely critical ones, as they are often isolated. The minimal float problem is NP-hard while the maximal float problem is polynomial. New complexity results and efficient algorithms are provided for the interval-valued makespan minimization problem.