Batching has been studied extensively in the offline case, but applications such as manufacturing or TCP acknowledgment often require online solutions. We consider online batching problems, where the order of jobs to be batched is fixed and where we seek to minimize the sum of the completion times of the jobs. We present optimally competitive online algorithms for both s-batch and p-batch probl...

We study the problems of scheduling jobs, with different release dates and equal processing times, on two types of batching machines. All jobs of the same batch start and are completed simultaneously. On a serial batching machine, the length of a batch equals the sum of the processing times of its jobs and, when a new batch starts, a constant setup time s occurs. On a parallel batching machine,...

This research deals with a hybrid flow shop scheduling problem with parallel batching, machine eligibility, unrelated parallel machine, and different release dates to minimize the sum of the total weighted earliness and tardiness (ET) penalties. In parallel batching situation, it is supposed that number of machine in some stages are able to perform a certain number of jobs simultaneously. First...

According to the traditional control methods of batching-material exists system defects low precision and bad real time, this paper has proposed the combined control algorithm. This paper has designed a Fuzzy-PID control Glass batching-material system by using of combining the traditional PID and the Fuzzy control algorithm. The system uses expert system of online learning and adjusts automatic...

An emerging class of distributed applications such as graph processing and key-value store require fine grained non-uniform memory access and communication, which commodity networking infrastructure is ill-equipped to handle. By batching messages on the end host we can increase bandwidth utilization at the cost of latency and memory. However, by batching messages in the network instead of exclu...

the product rate variation problem minimizes the variation in the rate at which different models of a common base product are produced on the assembly lines with the assumption of negligible switch-over cost and unit processing time for each copy of each model. the assumption of significant setup and arbitrary processing times forces the problem to be a two phase problem. the first phase determ...