Heuristic dispatching rules are one of the most popular and widely used methods of scheduling in dynamic job shop environments. The manual development of such dispatching rules is time consuming and requires substantial knowledge of the domain. There have been numerous works into using genetic programming (GP) as a framework for the automated generation of dispatching rules for job shop schedul...

This paper aims to present and evaluate the performance of one of the first real-time bus dispatching system in Bangkok, Thailand. The proposed bus dispatching system receives the real-time bus location data from the RFID sensor network. The paper provides the background and brief description of both the hardware and architecture of the RFID sensor network and the real-time bus dispatching syst...

We approximate optimal solutions to the Flexible Job-Shop Problem by using dispatching rules discovered through Genetic Programming. While Simple Priority Rules have been widely applied in practice, their efficacy remains poor due to lack of a global view. Composite Dispatching Rules have been shown to be more effective as they are constructed through human experience. In this work, we employ s...

This paper develops a novel genetic algorithm (GA) based methodology for optimal tuning of a reported fuzzy dispatching system for a fleet of automated guided vehicles in a flexible manufacturing environment. The reported dispatching rules are transformed into a continuously adaptive procedure to capitalize the on-line information available from a shop floor at all times. Simulation results obt...

Job shop scheduling problems with stochastic processing and sequence-dependent setup times and dynamic arrival of job types are real world and most complex among various scheduling problems. This paper extends the previous work of Sharma and Jain (2015) by assessing the performance of proposed four setups oriented dispatching rules with respect to bench mark dispatching rule taken from literatu...

DAB sample by Gregory Ketcham From "DAB test" (200740 SS111-V1 History of Western Civ I) Processed on 04-08-08 11:01 AM EDT ID: 65014463 Word Count: 1782 Overall Similarity Index: 67% sources: 29% match (internet) http://tigger.uic.edu/~lnucci/MoralEd/overviewtext.html 12% match (internet from 11/08/02) (11-8-02) http://www.apa.udel.edu/apa/archive/newsletters/v96n2/black/whatdoes.asp 10% match...

This paper describes the simulation-based synthesis of optimum dispatching rules for the wafer test area of a semiconductor production plant. The target of the optimisation task is the minimum average lead time under the constraint of maintaining on-time delivery. Dispatching is a very fast and robust technique for sequence-planning even when cycle times are not perfectly controlled. A broad ra...

In the single objective Unit Commitment Problem (UCP) the problem is usually separated in two sub-problems : the commitment problem which aims to fix the on/off scheduling of each unit and the dispatching problem which goal is to schedule the production of each turned on unit. The dispatching problem is a continuous convex problem that can easily be solved exactly. For the first sub-problem gen...

This paper discusses the principles of CRC, puts forward the CRC algorithm which is applicable to electric power dispatching system, and gives the implementation process of CRC check code in hardware and software of the electric power dispatching system.

Replication of information among multiple servers is necessary to support high request rates to popular Web sites. We consider systems that maintain one interface to the users, even if they consist of multiple nodes with visible IP addresses that are distributed among different networks. In these systems, the first-level dispatching is achieved through the Domain Name System (DNS) during the ad...