A two-phase metaheuristic approach for solving Economic Lot Scheduling Problems

C. Chandrasekaran, Chandrasekharan Rajendran, O.V. Krishnaiah Chetty and D. Hanumanna

International Journal of Operational Research, 2009, vol. 4, issue 3, 296-322

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.

Keywords: ELSP; economic lot scheduling problem; metaheuristics; GAs; genetic algorithm; ACA; ant colony algorithm; single-phase approach; two-phase approach; sequence-independent setup times; sequence-dependent setup times; backorder; lower bound; lot sizing. (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=23286 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:4:y:2009:i:3:p:296-322

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().