Dynamic lot sizing with multiple suppliers, backlogging and quantity discounts

Limited Access
This item is unavailable until:
2020-08-01
Date
2017
Authors
Ghaniabadi, M.
Mazinani, A.
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Source Title
Computers and Industrial Engineering
Print ISSN
0360-8352
Electronic ISSN
Publisher
Elsevier Ltd
Volume
110
Issue
Pages
67 - 74
Language
English
Journal Title
Journal ISSN
Volume Title
Series
Abstract

This paper studies the dynamic lot sizing problem with supplier selection, backlogging and quantity discounts. Two known discount types are considered separately, incremental and all-units quantity discounts. Mixed integer linear programming (MILP) formulations are presented for each case and solved using a commercial optimization software. In order to timely solve the problem, a recursive formulation and its efficient implementation are introduced for each case which result in an optimal and a near optimal solution for incremental and all-units quantity discount cases, respectively. Finally, the execution times of the MILP models and forward dynamic programming models obtained from the recursive formulations are presented and compared. The results demonstrate the efficiency of the dynamic programming models, as they can solve even large-sized instances quite timely. © 2017

Course
Other identifiers
Book Title
Citation
Published Version (Please cite this version)