Self-adaptive randomized constructive heuristics for the multi-item capacitated lot sizing problem (Q2676332): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Heuristics for the multi-item capacitated lot-sizing problem with lost sales / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst case analysis of relax and fix heuristics for lot-sizing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multi-item capacitated lot-sizing problem with safety stocks and demand shortage costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational analysis of lower bounds for big bucket production planning problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong Formulations for Multi-Item Capacitated Lot Sizing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-item dynamic lot-sizing problems: an updated survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial objective inequalities for the multi-item capacitated lot-sizing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set partitioning and column generation heuristics for capacitated dynamic lotsizing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The noising methods: A generalization of some metaheuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective matheuristics for the multi-item capacitated lot-sizing problem with remanufacturing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Horizon Decomposition Approach for the Capacitated Lot-Sizing Problem with Setup Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tabu-Search Heuristic for the Capacitated Lot-Sizing Problem with Set-up Carryover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planning lot sizes and capacity requirements in a single stage production system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-greedy heuristics: An empirical study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Designing new heuristics for the capacitated lot sizing problem by genetic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the CLSP by a Tabu Search Heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective heuristic for the CLSP with set-up times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search heuristic for solving the CLSP with backlogging and set-up carry-over / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new heuristic approach for the multi-item dynamic lot sizing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple heuristic for the multi-item single level capacitated lotsizing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-Item Single-Level Capacitated Dynamic Lot-Sizing Heuristics: A General Review / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perturbation heuristics for the pickup and delivery traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified priority index for Günther's lot-sizing heuristic under capacited single stage production / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>ABC</i> <sub>β</sub>–a heuristic for dynamic capacitated lot sizing with random demand under a fill rate constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-item lot size determination and scheduling under capacity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Version of the Economic Lot Size Model / rank
 
Normal rank

Latest revision as of 06:13, 30 July 2024

scientific article
Language Label Description Also known as
English
Self-adaptive randomized constructive heuristics for the multi-item capacitated lot sizing problem
scientific article

    Statements

    Self-adaptive randomized constructive heuristics for the multi-item capacitated lot sizing problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    27 September 2022
    0 references
    capacitated lot sizing problem
    0 references
    constructive heuristics
    0 references
    self-adaptive
    0 references
    perturbation strategy
    0 references
    period-by-period heuristic
    0 references
    lot elimination heuristic
    0 references
    0 references
    0 references

    Identifiers