This thesis proposes a new idea using association rule mining-based approach for discovering dispatching rules in production data. Decision trees have previously been used for the same purpose of finding dispatching rules. However, the nature of the decision tree as a classification method may cause incomplete discovery of dispatching rules, which can be complemented by association rule mining ...

We consider binary dispatching problem originating from object oriented programming. We want to preprocess a hierarchy of classes and collection of methods so that given a function call in the run-time we are able to retrieve the most specialized implementation which can be invoked with the actual types of the arguments. This problem has been thoroughly studied for the case of mono dispatching ...

Abstract: The application of large scale energy storage makes wind farms more dispatchable, which lowers operating risks to the grid from interconnected large scale wind farms. In order to make full use of the flexibility and controllability of energy storage to improve the schedulability of wind farms, this paper presents a rolling and dispatching control strategy with a battery energy storage...

Bank’s manual underwriting involves a group of underwriting inspectors, which perform a known set of procedures with the loan applications submitted by the borrowers, in order to determine the risk of providing a loan and eventually approve or disapprove it. Due to the fact that the evaluation process of applications must satisfy quality of service requirements usually set at legislator level a...

Policy iteration techniques for multiple-server dispatching rely on the computation of value functions. In this context, we consider continuous-space M/G/1-FCFS queue endowed with an arbitrarily designed cost function waiting times incoming jobs. The associated relative is a solution Poisson’s equation Markov chains, which in work solve Laplace transform domain by considering ancillary, underly...

To date, the study of dispatching or load balancing in server farms has primarily focused on the minimization ofresponse time. Server farms are typically modeled by a front-end router that employs a dispatching policy to routejobs to one of several servers, with each server scheduling all the jobs in its queue via Processor-Sharing. However,the common assumption has been that al...

Dynamic scheduling of manufacturing systems has primarily involved the use of dispatching rules. In the context of conventional job shops, the relative performance of these rules has been found to depend upon the system attributes, and no single rule is dominant across all possible scenarios. This indicates the need for developing a scheduling approach which adopts a state-dependent dispatching...

The dispatching problem for object oriented languages is the problem of determining the most specialized method to invoke for calls at run-time. This can be a critical component of execution performance. A number of recent results, including [Muthukrishnan and Müller SODA’96, Ferragina and Muthukrishnan ESA’96, Alstrup et al. FOCS’98], have studied this problem and in particular provided variou...

New programming languages that allow to reduce the complexity of software solutions are frequently developed, often as extensions of existing languages. Many implementations thus resort to transforming the extension’s source code to the imperative intermediate representation of the parent language. But approaches like compiler frameworks only allow for re-use of code transformations for syntact...

The speed of method dispatching is an important issue in the overall performance of object-oriented programs. We have developed an algorithm for constructing efficient dispatch functions for the general predicate dispatching model, which generalizes single dispatching, multiple dispatching, predicate classes and classifiers, and patternmatching. Our algorithm generates a lookup DAG each of whos...