We propose a new process scheduling queue system called the Distributed Queue Tree (DQT) for a distributed memory, dynamically partitionable parallel machines. We assume that partitions can be nested dynamically and that a process in a partition can be preempted. The combination of dynamically nested partitioning and time-sharing scheduling may provide an interactive environment and higher proc...

The RUN (Reduction to UNiprocessor)[3] algorithm was first described by Regnier, et al. as a novel solution to real-time multiprocessor scheduling, but its ideas can be applied to other scheduling problems involving arrays of similar resources. This technical report briefly describes how RUN can improve the management of network routes, queueing disciplines, disks, and batch schedulers.

The batch processing machines (BPMs) have the ability to process more than one job together (called a batch). So the scheduling problem of the BPMs concerns not only the priorities of the jobs obtaining the processing service of a BPM, but the number of the jobs processed together on them. According to diverse classified criteria (such as the number of the BPMs and the job families), the schedu...

Abstract— In order to determine factory capacity or necessary time to reach a desired quota, the manager of a multi-product batch manufacturing system must know the best method of scheduling for the factory. To determine the optimal scheduling, we first create a model of the factory. This model is used to simulate the factory. Using this simulation and an integer programming formulation, we det...

Starting from a comparative analysis of used algorithms in fabrication processes scheduling, this paper presents the advantages and efficient uses of genetic algorithms. In the case of technological processes of machining a flexible batch of marks, the structure of a scheduling optimization algorithm is presented, by the mean of different technical and economical priority rules. The paper outli...

This paper introduces optimal batch scheduling algorithms for the problem of scheduling batches of bursts in optical burst switching networks. The problem is modelled as a job scheduling problem with identical machines. The consideration of previously scheduled bursts in the scheduling allows such modeling. Two optimal algorithms with polynomial time complexity are derived and evaluated. Result...

This paper reports on the development of an interactive system for opportunistic real-time dynamic production scheduling of small-batch manufacture.

Traditional batch job schedulers are a poor fit for a grid computing environment. In order to respond to the grid scheduling challenges, the client must perform planning. In this paper, we expound upon the differences between planning versus scheduling, and present two grid projects which utilize a ClassAd matchmaking framework to enable planning on the grid. Planning for purposes of job placem...

Abstract The co-allocated data centers are to deploy online services and offline workloads in the same cluster improve utilization of resources. Spark application is a typical batch workload. At present, resource scheduling strategy for mainly focuses on services. applications still use original scheduling, which can’t solve dependency deadline problems between spark This paper proposes data-aw...

We consider the optimal scheduling of an infinite.capacity batch server in a N-node ring queueing network, where the controller observes only the length of the queue at which the server is located. For a cost criterion that includes linear holding costs, fixed dispatching costs, and linear service rewards, we prove optimality and monotonicity of threshold scheduling policies.