Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
A two-phase metaheuristic approach for solving economic lot scheduling problems - MaRDI portal

A two-phase metaheuristic approach for solving economic lot scheduling problems (Q1019572)

From MaRDI portal





scientific article; zbMATH DE number 5561300
Language Label Description Also known as
English
A two-phase metaheuristic approach for solving economic lot scheduling problems
scientific article; zbMATH DE number 5561300

    Statements

    A two-phase metaheuristic approach for solving economic lot scheduling problems (English)
    0 references
    3 June 2009
    0 references
    Summary: 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.
    0 references
    ELSP
    0 references
    economic lot scheduling problem
    0 references
    metaheuristics
    0 references
    gas
    0 references
    genetic algorithm
    0 references
    ACA
    0 references
    ant colony algorithm
    0 references
    single-phase approach
    0 references
    two-phase approach
    0 references
    sequence-independent setup times
    0 references
    sequence-dependent setup times
    0 references
    backorder
    0 references
    lower bound
    0 references
    lot sizing
    0 references

    Identifiers