{"type":"ScholarlyArticle","title":"Proactive Algorithms for Scheduling with Probabilistic Durations","authors":[{"name":"J. Christopher Beck","slug":"j-christopher-beck","given":"J. Christopher","family":"Beck","affiliation":""},{"name":"Nic Wilson","slug":"nic-wilson","given":"Nic","family":"Wilson","affiliation":""}],"abstract":"Proactive scheduling seeks to generate high quality solutions despite execution time uncertainty. Building on work in [Beck and Wilson, 2004], we conduct an empirical study of a number of algorithms for the job shop scheduling problem with probabilistic durations. The main contributions of this paper are: the introduction and empirical analysis of a novel constraint-based search technique that can be applied beyond probabilistic scheduling problems, the introduction and empirical analysis of a number of deterministic filtering algorithms for probabilistic job shop scheduling, and the identification of a number of problem characteristics that contribute to algorithm performance.","doi":null,"url":"https://ijcai.org/proceedings/2005/72","pdf":"https://ijcai.org/proceedings/2005/0072.pdf","markdown":"https://ijcai.org/proceedings/2005/72.md","bibtex":"https://ijcai.org/proceedings/2005/bibtex/72","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":72,"pages":{"first":1201,"last":1205},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}