A hybrid algorithm for solving the economic lot and delivery scheduling problem in the common cycle case

Jens Clausen, S. Ju

    Research output: Contribution to journalJournal articleResearchpeer-review

    Abstract

    The ELDSP problem is a combined lot sizing and sequencing problem. A supplier produces and delivers components of different types to a consumer in batches. The task is to determine the cycle time, i.e., the time between deliveries, which minimizes the total cost per time unit. This includes the determination of the production sequence of the component types within each cycle.

    We investigate the computational behavior of two published algorithms, a heuristic and an optimal algorithm. With large number of component types, the optimal algorithm has long running times. We devise a hybrid algorithm, which is both optimal and efficient. (c) 2005 Elsevier B.V. All rights reserved.
    Original languageEnglish
    JournalEuropean Journal of Operational Research
    Volume175
    Issue number2
    Pages (from-to)1141-1150
    ISSN0377-2217
    DOIs
    Publication statusPublished - 1 Dec 2006

    Keywords

    • scheduling
    • inventory
    • lot sizing

    Fingerprint Dive into the research topics of 'A hybrid algorithm for solving the economic lot and delivery scheduling problem in the common cycle case'. Together they form a unique fingerprint.

    Cite this