Lot-sizing problem with supplier selection considering safety stock

Author

Aouadni, Sourour ; Rebai, Abdelwaheb

Author_Institution

FSEG, Univ. of sfax, Sfax, Tunisia

fYear

2013

fDate

6-8 May 2013

Firstpage

766

Lastpage

769

Abstract

The Supplier selection problem is one of the most critical activities of purchasing management. Safety-stock has to be maintained to mitigate risk of stock-outs due to uncertainties in supply and demand. It is an objective to reach for organization. In this paper, we develop a new mixed integer programming model for a mono-item multi period inventory lot-sizing problem with supplier selection including safety stock. We consider a situation where the demand is known over a finite planning horizon. The buyer needs to decide what quantities to order, with which suppliers, and in which periods. The complexity of this problem is known to be NP-hard. We used a genetic algorithm (GA) to solve our problem.

Keywords

computational complexity; genetic algorithms; integer programming; lot sizing; purchasing; risk management; stock control; supply chain management; NP-hard problem; complexity; demand uncertainty; finite planning horizon; genetic algorithm; mixed integer programming model; monoitem multiperiod inventory lot-sizing problem; purchasing management; safety stock; stock-out risk mitigation; supplier selection problem; supply uncertainty; Genetic algorithms; Linear programming; Planning; Production; Safety; Sociology; Statistics; Genetic algorithm; Inventory lot-sizing; Mxed integer programming; Order quantities; Safety stock; Supplier selection problem;

fLanguage

English

Publisher

ieee

Conference_Titel

Control, Decision and Information Technologies (CoDIT), 2013 International Conference on

Conference_Location

Hammamet

Print_ISBN

978-1-4673-5547-6

Type

conf

DOI

10.1109/CoDIT.2013.6689639

Filename

6689639