Abstract—We consider the task of scheduling a conference based on incomplete information about resources and constraints, and describe a mechanism for the dynamic learning of related default assumptions, which enable the scheduling system to make reasonable guesses about missing data. We outline the representation of incomplete knowledge, describe the learning procedure, and demonstrate that the learned knowledge improves the scheduling results. Index Terms—Uncertainty, optimization, elicitation. I
The resource-constrained scheduling problem (RCSP) involves the assignment of a limited set of resou...
Finding optimal schedules for the most commonly considered classes of scheduling problems is NP-comp...
Abstract. We discuss the problem of scheduling tasks that consume uncertain amounts of a resource wi...
We describe a system for scheduling a conference based on incomplete information about available res...
We describe the representation of uncertain knowledge in a conference-scheduling system, which may i...
We consider the task of scheduling a conference based on incomplete data about available resource an...
Abstract—We consider the task of scheduling a conference based on incomplete data about available re...
We describe a system for scheduling a conference based on incomplete information about available res...
We consider the task of scheduling a conference based on incomplete data about available resource a...
When we work on a practical scheduling task, we usually do not have complete knowledge of the relate...
Incomplete information is a major challenge when translating combinatorial optimization results to r...
Abstract Mathematical-analytical methods as used in Operations Research approaches are often insuffi...
In this paper, we describe an approach to scheduling under uncertainty that achieves scalability thr...
During execution of a schedule some uncertain events may take place for example: resources may becom...
We discuss the problem of scheduling tasks that consume uncertain amounts of a resource with known c...
The resource-constrained scheduling problem (RCSP) involves the assignment of a limited set of resou...
Finding optimal schedules for the most commonly considered classes of scheduling problems is NP-comp...
Abstract. We discuss the problem of scheduling tasks that consume uncertain amounts of a resource wi...
We describe a system for scheduling a conference based on incomplete information about available res...
We describe the representation of uncertain knowledge in a conference-scheduling system, which may i...
We consider the task of scheduling a conference based on incomplete data about available resource an...
Abstract—We consider the task of scheduling a conference based on incomplete data about available re...
We describe a system for scheduling a conference based on incomplete information about available res...
We consider the task of scheduling a conference based on incomplete data about available resource a...
When we work on a practical scheduling task, we usually do not have complete knowledge of the relate...
Incomplete information is a major challenge when translating combinatorial optimization results to r...
Abstract Mathematical-analytical methods as used in Operations Research approaches are often insuffi...
In this paper, we describe an approach to scheduling under uncertainty that achieves scalability thr...
During execution of a schedule some uncertain events may take place for example: resources may becom...
We discuss the problem of scheduling tasks that consume uncertain amounts of a resource with known c...
The resource-constrained scheduling problem (RCSP) involves the assignment of a limited set of resou...
Finding optimal schedules for the most commonly considered classes of scheduling problems is NP-comp...
Abstract. We discuss the problem of scheduling tasks that consume uncertain amounts of a resource wi...