Predicate dispatching generalizes previous method dispatch mechanisms by permitting arbitrary predicates to control method applicability and by using logical implication between predicates as the overriding relationship. The method selected to handle a message send can depend not just on the classes of the arguments, as in ordinary object-oriented dispatch, but also on the classes of subcompone...

A key issue in automated seaport container terminals is the assignment of transportation orders to automated guided vehicles (AGVs). For AGV dispatching two basic types of strategies can be applied, which differ by the length of the look-ahead period and the rescheduling strategy. The on-line dispatching strategy uses myopic dispatching rules, which have been adopted from flexible manufacturing...

We propose a unified approach to plan execution and schedule dispatching that converts a plan, which has been augmented with temporal constraints, into a policy for dispatching. Our approach generalizes the original plan and temporal constraints so that the executor need only consider the subset of state that is relevant to successful execution of valid plan fragments. We can accommodate a vari...

In this paper, we exploit the speed of an ordinal optimization (OO)-based simulation tool designed by Hsieh et al. to investigate dynamic selection of scheduling rules for semiconductor wafer fabrication (fab). Although a scheduling rule is a combination of loading wafer release and dispatching rules, this paper specifically focuses on dispatching when significant amount of wafers-in-process (W...

There is a trend towards using object-oriented programming languages to develop hard real-time applications. However, some object-oriented features, such as dynamic dispatching and dynamic loading, are prohibited from being used in hard realtime systems because they are either unpredictable and/or unanalysable. Arguably, these restrictions could make applications very limited and unrealistic si...

Research on dispatching rules has focused upon deterministic job shop situations or small assembly environments and ignored operational factors. This work uses data obtained from a capital goods company that produces complex products. The paper first explores the influence of the data update period and the minimum setup, machining and transfer times under stochastic infinite capacity conditions...

In this paper new packet dispatching schemes for efficient support of the uniform as well as the nonuniform traffic distribution patterns in Memory-Space-Memory (MSM) Closnetwork switches are presented. Three such schemes, called Static Dispatching-First Choice (SD-FC), Static Dispatching-Optimal Choice (SD-OC) and Input Module (IM)-Output Module (OM) Matching (IOM), are proposed and evaluated....

We present an analysis for deadlock avoidance in manufacturing Flow-lines (FMRF). In FMRF, shared resources are not dedicated for certain jobs; choices in reentrant flow lines, i.e. routing decisions to be made. A Discrete Ev avoidance dispatching, which framework uses a rule-based matrix formulation, is u systems. The development of deadlock-free dispatching rules is derived from circu blockin...

In the contemporary business environment, to adhere to the need of the customers, caused the shift from mass production to mass-customization. This necessitates the supply chain (SC) to be effective flexible. The purpose of this paper is to seek flexibility through adoption of family-based dispatching rules under the influence of inventory system implemented at downstream echelons of an industr...