A Lagrangian relaxation-based method and models evaluation for multi-level lot sizing problems with backorders (Q336386): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Tao Wu / rank
Normal rank
 
Property / author
 
Property / author: Tao Wu / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B80 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C11 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C59 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6650430 / rank
 
Normal rank
Property / zbMATH Keywords
 
lot sizing
Property / zbMATH Keywords: lot sizing / rank
 
Normal rank
Property / zbMATH Keywords
 
production planning
Property / zbMATH Keywords: production planning / rank
 
Normal rank
Property / zbMATH Keywords
 
Lagrangian relaxation
Property / zbMATH Keywords: Lagrangian relaxation / rank
 
Normal rank
Property / zbMATH Keywords
 
optimization
Property / zbMATH Keywords: optimization / rank
 
Normal rank
Property / zbMATH Keywords
 
mixed integer programming
Property / zbMATH Keywords: mixed integer programming / rank
 
Normal rank
Property / zbMATH Keywords
 
heuristics
Property / zbMATH Keywords: heuristics / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2013.01.021 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2140029088 / rank
 
Normal rank
Property / cites work
 
Property / cites work: MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic approach for big bucket multi-level 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: Nonlinear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Programming Approaches to Capacity-Constrained MRP Systems: Review, Formulation and Problem Reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence of the LP relaxations of two strong formulations for the capacitated lot-sizing problem with setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated lot-sizing and scheduling by Lagrangean relaxation / 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: Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4139966 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uncapacitated lot sizing with backlogging: the convex hull / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lot-size models with backlogging: Strong reformulations and cutting planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Capacitated Lot-Sizing Problem with Linked Lot Sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic for the dynamic multi-level capacitated lotsizing problem with linked lotsizes for general product structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the equivalence of strong formulations for capacitated multi-level lot sizing problems with setup times / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:38, 12 July 2024

scientific article
Language Label Description Also known as
English
A Lagrangian relaxation-based method and models evaluation for multi-level lot sizing problems with backorders
scientific article

    Statements

    A Lagrangian relaxation-based method and models evaluation for multi-level lot sizing problems with backorders (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 November 2016
    0 references
    lot sizing
    0 references
    production planning
    0 references
    Lagrangian relaxation
    0 references
    optimization
    0 references
    mixed integer programming
    0 references
    heuristics
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references