An optimal shipment strategy for imperfect items in a stock-out situation

23Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

Abstract

The objective of this paper is to minimize the expected total cost by consolidating a number of batches of imperfect quality products of different cycles for a single shipment and maximize the expected average profit function. Shortages are allowed at the end of each ordering cycle and are partially backlogged. The stock-out period is assumed to be exponentially distributed. The ordered lot size and cycle length of all the ordering cycles of a shipping cycle are considered to be equal. The model is analyzed for both infinite and finite planning horizons. The percentage of defective items in a lot is assumed to follow a uniform distribution. All the fractions of imperfect quality items in the ordering cycles of each shipping phase are assumed to be independent and identically distributed. After the completion of a screening process, one portion of the perfect quality products is used to serve partial backlogging at a cost per unit and the rest of the stock is used to adjust the demand. Calculus method is used to obtain the optimal number of order cycles for shipment. Optimal shortage period, optimal lot size and expected average profit for the model are developed on both of the finite and infinite time horizons. A comparison between the our models and Maddah and Jaber's (2008) [1] model is done through numerical studies which are also used to illustrate the models graphically. © 2011 Elsevier Ltd.

Cite

CITATION STYLE

APA

Das Roy, M., Sana, S. S., & Chaudhuri, K. (2011). An optimal shipment strategy for imperfect items in a stock-out situation. Mathematical and Computer Modelling, 54(9–10), 2528–2543. https://doi.org/10.1016/j.mcm.2011.06.015

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free