IDEAS home Printed from
MyIDEAS: Log in (now much improved!) to save this article

Metaheuristics for solving economic lot scheduling problems (ELSP) using time-varying lot-sizes approach

Listed author(s):
  • C. Chandrasekaran
  • Chandrasekharan Rajendran
  • O.V. Krishnaiah Chetty
  • Donakonda Hanumanna
Registered author(s):

    The Economic Lot Scheduling Problem (ELSP) on a single facility (or machine) with the time-varying lot-sizes approach and with sequence-independent/sequence-dependent setup times of parts or products is studied in this paper. The objective is to minimise the long-run average inventory carrying cost and setup costs of products. While the frequency of production of a product is determined from an existing heuristic, we allow for possible changes in the heuristically computed frequencies of parts (or products) and hence attempt to reduce the total cost per cycle during the metaheuristic search process. Three metaheuristics, namely, a Genetic Algorithm (GA), a Simulated-annealing Algorithm (SA) and an Ant-Colony Algorithm (ACA) are proposed. A new crossover operator is designed and incorporated in the proposed GA. New perturbation schemes are incorporated in the proposed SA. In the proposed ACA, the initialisation and updating of pheromone intensity (or trails) are done subject to certain conditions presented in this work. The best-performing existing heuristic algorithm and the proposed algorithms for ELSP with sequence-independent setup times of products are evaluated by considering a couple of benchmark problems and by generating many problems with different number of products and comparing the solutions. In addition, we consider the case of sequence-dependent setup times and the associated setup costs. The performances of the existing algorithm and the proposed algorithms are evaluated by considering a proposed (computationally simple) lower bound on total cost per cycle with the consideration of sequence-dependent setup times and the associated setup costs of products. The computational performance analyses reveal the effectiveness of the proposed metaheuristics. [Received 2 September 2006; Revised 5 January 2007; Accepted 30 January 2007]

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

    File URL:
    Download Restriction: Access to full text is restricted to subscribers.

    As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

    Article provided by Inderscience Enterprises Ltd in its journal European J. of Industrial Engineering.

    Volume (Year): 1 (2007)
    Issue (Month): 2 ()
    Pages: 152-181

    in new window

    Handle: RePEc:ids:eujine:v:1:y:2007:i:2:p:152-181
    Contact details of provider: Web page:

    No references listed on IDEAS
    You can help add them by filling out this form.

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    When requesting a correction, please mention this item's handle: RePEc:ids:eujine:v:1:y:2007:i:2:p:152-181. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Darren Simpson)

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.