{"type":"ScholarlyArticle","title":"Minimizing a Makespan Under Uncertainty","authors":[{"name":"Jérôme Fortin","slug":"jerome-fortin","given":"Jérôme","family":"Fortin","affiliation":""},{"name":"Pawel Zielinski","slug":"pawel-zielinski","given":"Pawel","family":"Zielinski","affiliation":""},{"name":"Didier Dubois","slug":"didier-dubois","given":"Didier","family":"Dubois","affiliation":""},{"name":"Hélène Fargier","slug":"helene-fargier","given":"Helene","family":"Fargier","affiliation":""}],"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.","doi":null,"url":"https://ijcai.org/proceedings/2005/292","pdf":"https://ijcai.org/proceedings/2005/0292.pdf","markdown":"https://ijcai.org/proceedings/2005/292.md","bibtex":"https://ijcai.org/proceedings/2005/bibtex/292","volume":{"slug":"2005","title":"Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2005","url":"https://ijcai.org/proceedings/2005/","year":2005,"location":"Edinburgh, Scotland, UK","dates":"","editors":"","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":292,"pages":{"first":1519,"last":1519},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}