This paper is focused on the coordination of order and production policy between buyers and suppliers in supply chains. When a buyer and a supplier of an item work independently, the buyer will place orders based on his economic order quantity (EOQ). However, the buyer’s EOQ may not lead to an optimal policy for the supplier. It can be shown that a cooperative batching policy can reduce total c...

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

In this research, we study an extended version of the joint order batching and scheduling optimization for manual vegetable picking packing lines with consideration workers’ fatiguing effect. This problem is faced by many B2C fresh produce grocers in China on a daily basis which could severely decrease overall workflow efficiency distribution center customer satisfaction. sequencing problem, se...

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