Abstract In this paper, we consider a combination of the joint replenishment problem (JRP) and single-machine scheduling with release dates. There is single machine one or more item types. Each job has date, positive processing time, it requires subset items. A can be started at time t only if all required types were replenished between date point . The ordering for distinct jobs combined. obje...

We study a non–cooperative game for joint replenishment by n firms that operate under an EOQ–like setting. Each firm decides whether to replenish independently or to participate in joint replenishment,and how much to contribute to joint ordering costs in case of participation. Joint replenishment cycle time is set by an intermediary as the lowest cycle time that can be financed with the private...

Interdependence of minor ordering costs occurs in joint replenishment of inventory when the cost of placing an item in an order depends on which other items are also in the order. In this paper, we propose an evolutionary algorithm (EA) for joint replenishment of inventory which allows for the interdependence of minor ordering costs. Since solutions to the joint replenishment problem (JRP) can ...

The joint replenishment problem is a fundamental model in supply chain management theory that has applications in inventory management, logistics, and maintenance scheduling. In this problem, there are multiple item types, each having a given time-dependent sequence of demands that need to be satisfied. In order to satisfy demand, orders of the item types must be placed in advance of the due da...