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...

We consider the problem of nonclairvoyantly scheduling jobs, which arrive over time and have varying sizes and degrees of parallelizability, with the objective of minimizing the maximum flow. We give essentially tight bounds on the achievable competitiveness. More specifically we show that the competitive ratio of every deterministic nonclairvoyant algorithm is high, namely Ω( √ n). But there i...

Batching jobs in a manufacturing system is a very common policy in most industries. Main reasons for batching are avoidance of setups and/or facilitation of material handling. Batch processing systems often consist of multiple machines of different types for the range and volumes of products that have to be handled. Building on earlier research in aircraft industry, where the process of hardeni...

This paper investigates the impact of a vendor managed inventory (VMI) strategy upon transportation operations in a supply chain. Specifically, the issue of batching to enable better use of transport vehicles is studied. A system dynamics methodology is used to develop difference equation models of three scenarios–– traditional, internal consolidation and VMI. The holistic nature of inventory m...

Order Batching and Picker Routing Problems arise in warehouses when articles have to be retrieved from their storage location in order to satisfy a given demand specified by customer orders. The Order Batching Problem includes the grouping of a given set of customer orders into feasible picking orders such that the total length of all picker tours is minimized. The problem of determining the se...