Proactive algorithms for scheduling with probabilistic durations

Authors:
J. Christopher Beck;Nic Wilson
Affiliations:
Department of Mechanical & Industrial Engineering, University of Toronto, Canada;Cork Constraint Computation Centre, Department of Computer Science, University College Cork, Ireland
Venue:
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Year:
2005

Citing 5
Cited 4

A fast taboo search algorithm for the job shop problem

Management Science
Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics

Artificial Intelligence
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Algorithms for propagating resource constraints in AI planning and scheduling: existing approaches and new results

Artificial Intelligence
Contrasting Structured and Random Permutation Flow-Shop Scheduling Problems: Search-Space Topology and Algorithm Performance

INFORMS Journal on Computing

Scheduling with uncertain durations: Modeling β-robust scheduling with constraints

Computers and Operations Research
Proactive algorithms for job shop scheduling with probabilistic durations

Journal of Artificial Intelligence Research
A general framework for scheduling in a stochastic environment

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Scheduling conditional task graphs

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming

Quantified Score

Hi-index	0.00

Visualization

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.