Stochastic joint replenishment problem with quantity discounts and minimum order constraints

Ji Seong Noh, Jong Soo Kim, Biswajit Sarkar

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

This paper analyzes a logistics system involving a supplier who produces and delivers multiple types of items and a buyer who receives and sells to end customers. The buyer controls the inventory of each item by ordering at a preset time interval, which is an integer multiple of a base cycle, to meet the stochastic demands of the end customers. The supplier makes contracts with the buyer that specify that the ordered amount is delivered at the start of each period at a unit price determined by a quantity discount schedule. The contract also specifies that a buyer’s order should exceed a minimum order quantity. To analyze the system, a mathematical model describing activities for replenishing a single type of item is developed from the buyer’s perspective. An efficient method to determine the base cycle length and safety factor that minimizes the buyer’s total cost is then proposed. The single item model is extended to a multiple items joint replenishment model, and algorithms for finding a cost-minimizing base cycle, order interval multipliers, and safety factors are proposed. The result of computational experiments shows that the algorithms can find near-optimal solutions to the problem.

Original languageEnglish
Pages (from-to)151-178
Number of pages28
JournalOperational Research
Volume19
Issue number1
DOIs
Publication statusPublished - 2019 Mar 12

Fingerprint

Cycle Basis
Quantity Discount
Safety factor
Customers
Safety
Interval Order
Stochastic Demand
Joint Model
Cycle Length
Costs
Computational Experiments
Logistics
Multiplier
Exceed
Schedule
Optimal Solution
Mathematical Model
Mathematical models
Minimise
Interval

All Science Journal Classification (ASJC) codes

  • Numerical Analysis
  • Modelling and Simulation
  • Strategy and Management
  • Statistics, Probability and Uncertainty
  • Management Science and Operations Research
  • Computational Theory and Mathematics
  • Management of Technology and Innovation

Cite this

@article{413bc3dea8b147af9c11788c000dd13d,
title = "Stochastic joint replenishment problem with quantity discounts and minimum order constraints",
abstract = "This paper analyzes a logistics system involving a supplier who produces and delivers multiple types of items and a buyer who receives and sells to end customers. The buyer controls the inventory of each item by ordering at a preset time interval, which is an integer multiple of a base cycle, to meet the stochastic demands of the end customers. The supplier makes contracts with the buyer that specify that the ordered amount is delivered at the start of each period at a unit price determined by a quantity discount schedule. The contract also specifies that a buyer’s order should exceed a minimum order quantity. To analyze the system, a mathematical model describing activities for replenishing a single type of item is developed from the buyer’s perspective. An efficient method to determine the base cycle length and safety factor that minimizes the buyer’s total cost is then proposed. The single item model is extended to a multiple items joint replenishment model, and algorithms for finding a cost-minimizing base cycle, order interval multipliers, and safety factors are proposed. The result of computational experiments shows that the algorithms can find near-optimal solutions to the problem.",
author = "Noh, {Ji Seong} and Kim, {Jong Soo} and Biswajit Sarkar",
year = "2019",
month = "3",
day = "12",
doi = "10.1007/s12351-016-0281-6",
language = "English",
volume = "19",
pages = "151--178",
journal = "Operational Research",
issn = "1109-2858",
publisher = "Springer Verlag",
number = "1",

}

Stochastic joint replenishment problem with quantity discounts and minimum order constraints. / Noh, Ji Seong; Kim, Jong Soo; Sarkar, Biswajit.

In: Operational Research, Vol. 19, No. 1, 12.03.2019, p. 151-178.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Stochastic joint replenishment problem with quantity discounts and minimum order constraints

AU - Noh, Ji Seong

AU - Kim, Jong Soo

AU - Sarkar, Biswajit

PY - 2019/3/12

Y1 - 2019/3/12

N2 - This paper analyzes a logistics system involving a supplier who produces and delivers multiple types of items and a buyer who receives and sells to end customers. The buyer controls the inventory of each item by ordering at a preset time interval, which is an integer multiple of a base cycle, to meet the stochastic demands of the end customers. The supplier makes contracts with the buyer that specify that the ordered amount is delivered at the start of each period at a unit price determined by a quantity discount schedule. The contract also specifies that a buyer’s order should exceed a minimum order quantity. To analyze the system, a mathematical model describing activities for replenishing a single type of item is developed from the buyer’s perspective. An efficient method to determine the base cycle length and safety factor that minimizes the buyer’s total cost is then proposed. The single item model is extended to a multiple items joint replenishment model, and algorithms for finding a cost-minimizing base cycle, order interval multipliers, and safety factors are proposed. The result of computational experiments shows that the algorithms can find near-optimal solutions to the problem.

AB - This paper analyzes a logistics system involving a supplier who produces and delivers multiple types of items and a buyer who receives and sells to end customers. The buyer controls the inventory of each item by ordering at a preset time interval, which is an integer multiple of a base cycle, to meet the stochastic demands of the end customers. The supplier makes contracts with the buyer that specify that the ordered amount is delivered at the start of each period at a unit price determined by a quantity discount schedule. The contract also specifies that a buyer’s order should exceed a minimum order quantity. To analyze the system, a mathematical model describing activities for replenishing a single type of item is developed from the buyer’s perspective. An efficient method to determine the base cycle length and safety factor that minimizes the buyer’s total cost is then proposed. The single item model is extended to a multiple items joint replenishment model, and algorithms for finding a cost-minimizing base cycle, order interval multipliers, and safety factors are proposed. The result of computational experiments shows that the algorithms can find near-optimal solutions to the problem.

UR - http://www.scopus.com/inward/record.url?scp=85002165452&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85002165452&partnerID=8YFLogxK

U2 - 10.1007/s12351-016-0281-6

DO - 10.1007/s12351-016-0281-6

M3 - Article

AN - SCOPUS:85002165452

VL - 19

SP - 151

EP - 178

JO - Operational Research

JF - Operational Research

SN - 1109-2858

IS - 1

ER -