Scheduling of multi-buyer joint replenishments

An effective and efficient differential evolution algorithm for the integrated stochastic joint replenishment and delivery model

“…For example, Chan et al [5] developed a solution method to decide the delivery scheduling after the replenishment cycle and quantity of each item were known by solving the JRP under four different objectives. Cha et al [4] dealt with the JRD model of the one-warehouse and n-retailer system and suggested a flexible policy for the warehouse.…”

A review of the joint replenishment problem literature: 1989–2005

“…Similar solution method to the one in Siajadi et al (2005) was applied to solve the problem. Chan et al (2006) developed a solution approach to scheduling deliveries from a supplier to many buyers who use the JRP in replenishing their inventory from the supplier. The delivery scheduling problem was formulated under four different objectives: minimizing the maximum number of products delivered at any time period, minimizing the maximum number of buyers visited at any time period, minimizing the total number of buyer's visits, and minimizing the number of required trucks.…”

Determining the Optimum Ordering Policy in Multi-Item Joint Replenishment Problem Using a Novel Method

“…Detailed surveys of the JRP are available in [1][2][3]. Numerous heuristic algorithms have been developed for the JRP [4][5][6][7][8], but few optimal algorithms have been proposed. Balintfy [9] was among the first to consider the case in which joint ordering of several items may result in savings in set-up costs.…”