We address the problem of scheduling n jobs on a batching machine to minimize regular scheduling criteria that are non-decreasing in the job completion times. A batching machine is a machine that can handle up to b jobs simultaneously. The jobs that are processed together form a batch, and all jobs in a batch start and complete at the same time. The processing time of a batch is equal to the la...

Jobs can be batched if they share the same setup times on a machine in many practical situations. Another reason for batching arises when a machine can process several jobs at the same time. On the other hand, splitting a job or lot which consists of many identical items often increases customer service and decreases throughput time. Especially in CIM (Computer Integrated Manufacturing) these d...

The variety of possible anonymity network topologies has spurred much debate in recent years. In a synchronous batching design, each batch of messages enters the mix network together, and the messages proceed in lockstep through the network. We show that a synchronous batching strategy can be used in various topologies, including a free-route network, in which senders choose paths freely, and a...

We propose a mini-batching scheme for improving the theoretical complexity and practical performance of semi-stochastic gradient descent applied to the problem of minimizing a strongly convex composite function represented as the sum of an average of a large number of smooth convex functions, and simple nonsmooth convex function. Our method first performs a deterministic step (computation of th...

Scheduling decisions in the diffusion and cleaning area can be crucial for the overall performance of a semiconductor manufacturing facility. This area includes complex production constraints and long processing durations. Consequently, we want to optimize scheduling decisions in this area while taking all relevant real-world constraints into account. An important property of machines in this w...

Abstract We study dynamic matching in exchange markets with easy- and hard-to-match agents. A greedy policy, which attempts to match agents upon arrival, ignores the positive externality that waiting provide by facilitating future matchings. prove trade-off between a “thicker” market faster vanishes large markets; policy leads shorter times more matched than any other policy. empirically confir...