Staff scheduling is a <span lang="EN-US">combinatorics optimization problem and companies face this complex task on daily basis in constructing schedule fitting all conditions. In courier distribution center, staffs are assigned to work processes of continuous workflow. Staffs have varying ability for each process. Instead generating staff instinctively, it an advantage optimize staff’s b...

Three different mathematical formulations for the scheduling of pumps to minimize energy consumption while still satisfying operational constraints are presented. Each formulation requires the solution of a highly nonlinear optimization problem that requires the iterative solution of an external numerical model for evaluating and satisfying the operational constraints. Two different algorithms ...

Many existing studies in overlay networking have focused on resource discovery or server selection. This work studies the integrated performance of peer-to-peer (P2P) file sharing systems using location-aware resource discovery and service scheduling schemes. A novel file capacity amplification (FCA) model is first presented to capture the problem of the file distribution problem. Then two nove...

The primary goal of processor scheduling is to assign tasks in a parallel program to processors, so as to minimize the execution time. Most existing approaches to processor scheduling for multiprocessors assume that the execution time of each task is xed and is independent of processor scheduling. In this paper, we argue that the execution time of a given task is not xed but is critically depen...

Task Scheduling is a critical design issue of distributed computing. The emerging Grid computing infrastructure consists of heterogeneous resources in widely distributed autonomous domains and makes task scheduling even more challenging. Grid considers both static, unmovable hardware and moveable, replicable data as computing resources. While intensive research has been done on task scheduling ...

In this paper, we analyze the characteristics of the job shop scheduling problem. A new genetic algorithm for solving the agile job shop scheduling is presented to solve the job shop scheduling problem. Initial population is generated randomly. Two-row chromosome structure is adopted based on working procedure and machine distribution. The relevant crossover and mutation operation is also desig...

As functional components like switch structure and cache do not need acceleration, the input buffer program becomes the mainstream structure of high-performance devices. Fair resource allocation is a necessary condition for achieving service quality control. The switch scheduling should take both scheduling efficiency and fair resource allocation into account. An iterative matching scheduling a...