A two-phase metaheuristic approach for solving Economic Lot Scheduling Problems
by C. Chandrasekaran, Chandrasekharan Rajendran, O.V. Krishnaiah Chetty, D. Hanumanna
International Journal of Operational Research (IJOR), Vol. 4, No. 3, 2009

Abstract: In this paper, economic lot scheduling problem is investigated using time-varying lot sizes approach. The process of finding the best production sequence consists of two-phase implementation of metaheuristics. In the first phase, we propose a genetic algorithm that makes use of the proposed new lower bound to arrive at the good set of production frequencies of products for ELSP without/with backorders. In the second phase, the best sequence of part production is achieved by using the above set of frequencies and employing a GA and an ant-colony algorithm. Computational experiments reveal the effectiveness of the two-phase approach over the conventional single-phase approach.

Online publication date: Tue, 17-Feb-2009

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 Operational Research (IJOR):
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