نتایج جستجو برای: dispatching

تعداد نتایج: 2533  

2016
PATRICK T. HARKER

The authors argue that the primary purpose of dispatching tools is to allow trains to arrive on time rather than to minimize train delays in general and present a new methodological framework for the role of computer-aided train-dispatching ( AD) systems. One of the biggest obstacles ro ihe uccessful implemcntarion of an optimal CAD sy tern i the combinatorial nature of the optimal train-dispat...

1998
Michael Ernst Craig Kaplan

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...

2002
Chin-I Liu

Abstract: In machine job shops with automated guided vehicles (AGVs) as mean of transportation of job parts, it’s usually hard to determine the optimal fleet size of AGVs for achieving a desired performance. In this paper a heuristic AGV dispatching algorithm is constructed based on the concept of ideal pipeline and Petri Net theory to balance the job part scheduling and AGV dispatching that mi...

Journal: :JNW 2014
Zhicheng Bian Weijian Mi Xiaoming Yang Ning Zhao Chao Mi

It is a fundamental decision making process in container terminals to allocate container transporting works among ALVs. Nowadays, container terminals tend to be larger in storage space and more efficient in handling. As a result, estimations of ALV travel times could be inaccurate, the scale of ALV work allocation could be quite large, and a fixed handling sequence could be hardly ensured befor...

1998
Yeong-Dae Kim Hong-Bae Jun

This paper focuses on lot release control and scheduling problems in a semiconductor wafer fab producing multiple products that have different due dates and different process flows. For lot release control, it is necessary to determine the type of a wafer lot and the time to release wafers into the wafer fab, while it is necessary to determine sequences of processing waiting lots in front of wo...

2003
Oliver Rose

In this study we compare the cycle-time and on-time-delivery performance of the Critical Ratio (CR), the Earliest Due Date (EDD), and the Operation Due Date (ODD) dispatching rules in semiconductor wafer manufacturing. In addition, we comment on the robustness of the rules to low target flow factor values. It turns out that EDD has almost no positive effect on on-time delivery compared to First...

2015
Michael Gierczak Oliver Englisch Ulrich Bretschneider

The remarkable growth of crowdfunding has sparked academic interest. By collecting small contributions from a large number of individuals, entrepreneurs, artists and other individuals and organizations can raise considerable amounts of money. Despite the increasing academic interest in this topic, there still appears to be a lack of understanding regarding the factors that determine individuals...

2005
Hal Daumé Daniel Marcu

Entity detection and tracking (EDT) is the task of identifying textual mentions of real-world entities in documents, extending the named entity detection and coreference resolution task by considering mentions other than names (pronouns, definite descriptions, etc.). Like NE tagging and coreference resolution, most solutions to the EDT task separate out the mention detection aspect from the cor...

1998
Paolo Priore David de la Fuente García Isabel Fernández Quesada

The problem of manufacturing systems scheduling by means of dispatching rules is that these rules depend on the state in which the system is in every moment. Therefore it would be interesting to use in every state of the system, the most adequate dispatching rule to that state. To achieve this goal, it is presented in this paper a scheduling approach which uses machine learning. This approach, ...

2001
Mark D. Johnston

A novel approach to reconciling global optimizing scheduling with real-time dispatching is presented. High speed scheduling is accomplished by two simultaneous cooperating scheduling processes, one of which generates longer term schedules while the other is focused with higher resolution on the nearer term. Real-time dispatching is based on the most recently generated near term schedule, carefu...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید