Multi-periodic joint replenishment planning method for various all-unit discounts

Métaireau, Agathe; Sahu, Rabin; Delecourt, Simon; Gerussi, Alexandre; Davy, Manuel

Type de document :

Communication dans un congrès avec actes

DOI :

10.5220/0010986800003117

Titre :

Multi-periodic joint replenishment planning method for various all-unit discounts

Auteur(s) :

Métaireau, Agathe [Auteur]
Operational Research, Knowledge And Data [ORKAD]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Sahu, Rabin [Auteur]
Operational Research, Knowledge And Data [ORKAD]
Delecourt, Simon [Auteur]
Gerussi, Alexandre [Auteur]
Davy, Manuel [Auteur]

Titre de la manifestation scientifique :

ICORES (International Conference on Operations Research and Enterprise Systems) 2022

Ville :

Lisbon

Pays :

Portugal

Date de début de la manifestation scientifique :

2022-02-03

Éditeur :

SCITEPRESS - Science and Technology Publications

Mot(s)-clé(s) en anglais :

Joint replenishment
Multi-period planning
Inventory control
Integer Linear Programming

Discipline(s) HAL :

Computer Science [cs]/Operations Research [math.OC]

Résumé en anglais : [en]

This paper aims at developing a multiperiodic joint replenishment optimization method to tackle all-unit discounts. In many industrial contexts, there exist multi-item constraints that can't be treated by single-item ...
Lire la suite >This paper aims at developing a multiperiodic joint replenishment optimization method to tackle all-unit discounts. In many industrial contexts, there exist multi-item constraints that can't be treated by single-item optimization. For example, suppliers can charge a fixed ordering cost or offer a discount above a given ordered quantity. To tackle such constraints, we set in place a model based on ordering blocks. This modeling enables to reduce the search-space by predetermining a given set of possible order quantities. The model is then solved using an Integer Linear Program that outputs the ordering plan for a given time horizon. This Integer Linear Program searches for the ordering block combination that gives the minimal cost. The cost function includes single-item costs like purchase or inventory costs as well as multi-item costs. The methodology was tested on twenty generated instances and compared with a single-period single-item replenishment engine. We show that our multiperiodic joint replenishment approach allows a reduction of the costs and an increase in the service level.Lire moins >

Langue :

Anglais

Comité de lecture :

Oui

Audience :

Internationale

Vulgarisation :

Non

Collections :

Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189

Source :

Harvested from HAL

Fichiers

https://hal.archives-ouvertes.fr/hal-03563906/document
Accès libre
Accéder au document

https://hal.archives-ouvertes.fr/hal-03563906/document
Accès libre
Accéder au document

document
Accès libre
Accéder au document

M%C3%A9taireau_ICORES_2022.pdf
Accès libre
Accéder au document

document
Accès libre
Accéder au document

M%C3%A9taireau_ICORES_2022.pdf
Accès libre
Accéder au document

Multi-periodic joint replenishment planning ... BibTeX CSV Excel RIS

Fichiers

Multi-periodic joint replenishment planning ...

BibTeX

CSV

Excel

RIS