A time-varying lot size method for the economic lot scheduling problem with shelf life considerations
by Jiyin Liu, Lina Wu, Zhili Zhou
European J. of Industrial Engineering (EJIE), Vol. 2, No. 3, 2008

Abstract: Most studies on the economic lot scheduling problem with shelf life considerations adopt the common cycle approach which usually gives a result with high cost. Basic period method has been applied to this problem recently resulting in a lower cost. This paper takes a time-varying lot size approach. Two models are formulated to optimise the production schedule for any given production sequence, one assuming that production of each product starts only when the inventory of this product becomes zero, and the other relaxing this restriction. To generate production sequences, we use an existing heuristic and also develop a new heuristic. Numerical experiments on a benchmark problem show that at all the utilisation levels tested the new method outperforms previous methods. Further experiments show that the production frequencies for the products, production sequence and a less restricted scheduling model all contribute to the low production cost. [Received: 22 August 2006; Revised: 28 October 2007; Accepted: 12 December 2007]

Online publication date: Wed, 26-Mar-2008

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 European J. of Industrial Engineering (EJIE):
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