In traditional batch-service queueing systems, the mean service time of batches are generally assumed to be constant. However, in numerous applications this assumption may not appropriate. telecommunication networks, transmission rates depend on number packets batch which can framed as batch-size-dependent queue. The objective paper is focus both queue and server content distribution an infinit...

This paper contains a design proposal for facilities for doing batch simulations in Design/CPN. These facilities can be used for running a group of simulations without user interaction. We discuss what kind of functionality is needed to run batch simulations. We also give proposals on how to implement this functionality in Design/CPN. To illustrate the use of the batch scripting facilities we p...

Run-to-run optimization methodologies exploit the repetitive nature of batch processes to find the optimal operating policy in the presence of uncertainty. For the class of batch optimization problems where the solution is determined by terminal constraints, the update of the decision variables towards their optimal values is realized using a constraint control scheme. The methodology is adapte...

We consider an online scheduling problem in a parallel batch processing system with jobs in a batch being allowed to restart. Online means that jobs arrive over time, and all jobs’ characteristics are unknown before their arrival times. A parallel batch processing machine can handle up to several jobs simultaneously. All jobs in a batch start and complete at the same time. The processing time o...

In the paper, we study the mini-batch stochastic ADMMs (alternating direction method of multipliers) for the nonconvex nonsmooth optimization. We prove that, given an appropriate mini-batch size, the mini-batch stochastic ADMM without variance reduction (VR) technique is convergent and reaches the convergence rate of O(1/T ) to obtain a stationary point of the nonconvex optimization, where T de...

This paper deals with semi-online scheduling on two parallel batch processing machines with jobs’ nondecreasing processing times. Our objective is to minimize the makespan. A batch processing machine can handle up to B jobs simultaneously. We study unbounded model which means that B is sufficiently large. The jobs that are processed together construct a batch, and all jobs in a batch start and ...

The use of batch means is a well known technique for estimating the variance of point estimators computed from simulation experiments. The batch means variance estimator is simply the (appropriately scaled) sample variance of the estimator computed on subsets of consecutive observations. For the method to be practical, a good choice of batch length is necessary. We propose a method to estimate ...

This paper studies the performance of pipeline network coding for multicast stream distribution in high loss rate MANET scenarios. Most of the previous network coding implementations have been based on batch network coding, where all blocks in the same batch are mixed together. Batch coding requires that the entire batch is received before decoding at destination. Thus, it introduces high decod...

Batch codes, introduced by Ishai et al. encode a string $x \in \Sigma^{k}$ into an $m$-tuple of strings, called buckets. In this paper we consider multiset batch codes wherein a set of $t$-users wish to access one bit of information each from the original string. We introduce a concept of optimal batch codes. We first show that binary Hamming codes are optimal batch codes. The main body of this...