1. fntroduction We consider poliing systems where service is given in batches of unlimited size. When the server visits a queue, all customers present are served in a single batch. We call tlis gated batch seruice. The batch service time is independent of the size of the batch. Some examples of such systems are discussed in the literature below. Examples more related to manufacturing are ovens,...

batch sizing in different planning period is categorized as a classical problem in production planning, that so many exact & heuristic methods have been proposed to solve this problem, each of which considering various aspects of the original problem. the solution obtained from majority – e.g. mrp – is in this format that there may be some periods of idleness or each period should produ...

This paper considers the scheduling problem of parallel batch processing machines with non-identical job size and processing time. In this paper, a new mathematical model with ready time and batch size constraints is presented to formulate the problem mathematically, in which simultaneous reduction of the makespan and earliness-tardiness is the objective function. In recent years, the nature-in...

Parallel processing is the key to fulfill the high demands on computational resources in scientific computing. This has further pushed researches in High Performance Computing into the mainstream. Numerous powerful computer systems are then born. Especially, low-cost powerful clusters, which are set up by connecting many personal computers/workstations in a high speed network, were developed ra...

Challenges exist for the study of time dependent sorption processes for heterogeneous systems, especially in the case of dispersed nanomaterials in solvents or solutions because they are not well suited to conventional batch kinetic experiments. In this study, a comparison of batch versus a one-pot setup in two variable configurations was evaluated for the study of uptake kinetics in heterogene...

Batch servers are capable of processing batches of packets instead of individual packets. Although batch-service queueing models have been studied extensively during the past decades, the focus was mainly put on calculating performance measures related to the buffer content, whereas less attention has been paid to the packet delay. In this paper, we focus on the tail probabilities of the delay ...

This paper presents iterative learning control (ILC) schemes for batch-varying references. Generally, reference or target trajectory must be identical for all iterations to implement the ILC. However, references can be changed in dynamic systems such as robotics and chemical processes according to cycle or batch. ILC schemes for batch-varying references are proposed in three forms which are inv...

The shortcomings and drawbacks of batch-oriented data processing were widely recognized by the Big Data community quite a long time ago. It became clear that realtime query processing and in-stream processing is the immediate need in many practical applications. In recent years, this idea got a lot of traction and a whole bunch of solutions like Twitter’s Storm, Yahoo’s S4, Cloudera’s Impala, A...

BACKGROUND The initial part of process development involves extensive screening programs to identify optimal biological systems and cultivation conditions. For a successful scale-up, the operation mode on screening and production scale must be as close as possible. To enable screening under fed-batch conditions, the membrane-based fed-batch shake flask was developed. It is a shake flask mounted...