Efficient near-optimal procedures for some inventory models with backorders-lost sales mixture and controllable lead time, under continuous or periodic review
by Marcello Braglia; Davide Castellano; Dongping Song
International Journal of Mathematics in Operational Research (IJMOR), Vol. 13, No. 2, 2018

Abstract: This paper considers a number of inventory models with backorders-lost sales mixture, stockout costs, and controllable lead time. The lead time is a linear function of the lot size and includes a constant term that is made of several components. These lot-size-independent components are assumed to be controllable. Both single- and double-echelon inventory systems, under periodic or continuous review, are considered. To authors knowledge, these models have never been previously studied in literature. The purpose of this paper is to analyse and optimise these novel inventory models. The optimisation is carried out by means of heuristics that work on an ad hoc approximation of the cost functions. This peculiarity permits to exploit closed-form expressions that make the optimisation procedure simpler and more readily applicable in practice than standard approaches. Finally, numerical experiments investigate the efficiency of the proposed heuristics and the sensitivity of the developed models.

Online publication date: Tue, 14-Aug-2018

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com