Modelling a Multi-Period Joint Replenishment Problem with Quantity Discounts

In a classic Joint Replenishment problem, a retailer faces the problem of ordering multiple products from a single supply source. The retailers are sometimes offered discounts, but these discount conditions might be of a different criterion of which they have to select one. Although there has been s...

Full description

Bibliographic Details
Main Author: Haidula, Johannes
Format: Dissertation (University of Nottingham only)
Language:English
Published: 2020
Online Access:https://eprints.nottingham.ac.uk/62004/
_version_ 1848799925574303744
author Haidula, Johannes
author_facet Haidula, Johannes
author_sort Haidula, Johannes
building Nottingham Research Data Repository
collection Online Access
description In a classic Joint Replenishment problem, a retailer faces the problem of ordering multiple products from a single supply source. The retailers are sometimes offered discounts, but these discount conditions might be of a different criterion of which they have to select one. Although there has been substantial research undertaken that developed unique solution approaches in the literature using techniques such as metaheuristics, constructive heuristic, and genetic algorithms, it is essential to cement the utilisation of quantitative decision models for managerial insights. Moreover, joint replenishment with quantity discount and complicating constraints of full truckload under exact optimisation has not been dealt with in literature. This study developed a non-linear integer programming model that groups items into optimal groups to exploit full discount. Firstly, a single item algorithm that gives the optimum purchasing policy based on Economic Order Quantity (EOQ) is developed. The results show that the ordering periods of items are not synchronised that results in more orders. A non-linear integer programming is then developed focusing on one product family and giving discount groups. Additional functions are also added to enable the model to accommodate different family groups as well as discount level. A computational experimental test was conducted to determine the performance of the policy under different input parameter like inventory size, setup cost and holding cost. Results show excellent performance that demonstrates the practicality of the designed model in solving complex purchasing decisions. This model should therefore be of value to buyers in their purchasing decision process. Keywords: Joint Replenishment Problem, Full truckload, Quantity Discount, Grouping, Multi-Period
first_indexed 2025-11-14T20:43:25Z
format Dissertation (University of Nottingham only)
id nottingham-62004
institution University of Nottingham Malaysia Campus
institution_category Local University
language English
last_indexed 2025-11-14T20:43:25Z
publishDate 2020
recordtype eprints
repository_type Digital Repository
spelling nottingham-620042022-12-21T13:59:14Z https://eprints.nottingham.ac.uk/62004/ Modelling a Multi-Period Joint Replenishment Problem with Quantity Discounts Haidula, Johannes In a classic Joint Replenishment problem, a retailer faces the problem of ordering multiple products from a single supply source. The retailers are sometimes offered discounts, but these discount conditions might be of a different criterion of which they have to select one. Although there has been substantial research undertaken that developed unique solution approaches in the literature using techniques such as metaheuristics, constructive heuristic, and genetic algorithms, it is essential to cement the utilisation of quantitative decision models for managerial insights. Moreover, joint replenishment with quantity discount and complicating constraints of full truckload under exact optimisation has not been dealt with in literature. This study developed a non-linear integer programming model that groups items into optimal groups to exploit full discount. Firstly, a single item algorithm that gives the optimum purchasing policy based on Economic Order Quantity (EOQ) is developed. The results show that the ordering periods of items are not synchronised that results in more orders. A non-linear integer programming is then developed focusing on one product family and giving discount groups. Additional functions are also added to enable the model to accommodate different family groups as well as discount level. A computational experimental test was conducted to determine the performance of the policy under different input parameter like inventory size, setup cost and holding cost. Results show excellent performance that demonstrates the practicality of the designed model in solving complex purchasing decisions. This model should therefore be of value to buyers in their purchasing decision process. Keywords: Joint Replenishment Problem, Full truckload, Quantity Discount, Grouping, Multi-Period 2020-12-01 Dissertation (University of Nottingham only) NonPeerReviewed application/pdf en https://eprints.nottingham.ac.uk/62004/1/20162198_BUSI4039_Dissertation%2CModelling%20a%20Multi-Period%20Joint%20Replenishment%20Problem%20with%20Quantity%20Discounts.pdf Haidula, Johannes (2020) Modelling a Multi-Period Joint Replenishment Problem with Quantity Discounts. [Dissertation (University of Nottingham only)]
spellingShingle Haidula, Johannes
Modelling a Multi-Period Joint Replenishment Problem with Quantity Discounts
title Modelling a Multi-Period Joint Replenishment Problem with Quantity Discounts
title_full Modelling a Multi-Period Joint Replenishment Problem with Quantity Discounts
title_fullStr Modelling a Multi-Period Joint Replenishment Problem with Quantity Discounts
title_full_unstemmed Modelling a Multi-Period Joint Replenishment Problem with Quantity Discounts
title_short Modelling a Multi-Period Joint Replenishment Problem with Quantity Discounts
title_sort modelling a multi-period joint replenishment problem with quantity discounts
url https://eprints.nottingham.ac.uk/62004/