Many works have reported simulated performance benefits of stream reuse techniques such as batching, chaining, and patching to the scalability of VoD systems. However, the relative contribution of such techniques has been rarely evaluated in practical implementations of scalable VoD servers. In this work, we investigated the efficiency of representative stream reuse techniques on the GloVE syst...

The development of a public test bed for manufacturing planning and scheduling brings a lot of design issues, along several dimensions: the content of the test bed, the testing protocol, the format of the data, and the management of the results obtained. The objective of the present paper is to discuss these issues and explain the rationale behind the choices that have been made in MaScLib, a l...

This paper discusses the problem of minimizing the cost of sheet metal punching when nesting (batching) orders. Although the problem is NP-complete, the solution to a linear programming relaxation yields an efficient heuristic. This paper analyzes the heuristic’s worst-case performance and discusses experimental results that demonstrate its ability to find good solutions across a range of cost ...

This paper describes models that estimate the cost and time of sheet metal punching when nesting (batching) orders. These models help decision{makers plan production and evaluate the impact of changing the nesting policy. In addition, we use them to formulate a nesting optimization problem. Finally, we use the models to evaluate the sensitivity of the nesting policy to manufacturing parameters....

We present query execution strategies that are optimized for the characteristics of tertiary memory devices. Traditional query execution methods are oriented to magnetic disk or main memory and perform poorly on tertiary memory. Our methods use ordering and batching techniques on the I/O requests to reduce the media switch cost and seek cost on these devices. Some of our methods are provably op...

Since many applications require the verification of large sets of signatures, it is sometimes advantageous to perform a simultaneous verification instead of checking each signature individually. The simultaneous processing, called batching, must be provably equivalent to the sequential verification of all signatures. In eurocrypt’98, Bellare et al. [1] presented a fast RSA batch verification sc...

Order picking has been considered as one of the most critical operations in warehouse. In this study, we propose an analytical approximation model based on probability and queueing network theory to analyze order batching and picking area zoning on the mean order throughput time in a synchronized zone picker-to-part order picking system. The resulting model can be easily applied in the design a...

We present a new type of formulation for scheduling problems where jobs are identical in all aspects but one. This type of formulation is particularly useful for deriving Lagrangian lower and upper bounds for owshop problems, where the jobs only diier in their processing times. We illustrate the eeectiveness of this type of formulation for a two-machine owshop problem where the rst machine is a...

We consider the problem of scheduling n jobs onm identical parallel batching machines. Each job is characterized by a release time and a processing time. Each machine can process up to B (B < n ) jobs as a batch simultaneously. The processing time of a batch is equal to the largest processing time among all jobs in the batch. The objective is to minimize the maximum completion time (makespan). ...