A computational analysis of lower bounds for big bucket production planning problems (Q1935570): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
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: Multi-item lot-sizing with joint set-up costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A study of the lot-sizing polytope / 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: Uncapacitated lot-sizing: The convex hull of solutions / 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: Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for Multilevel Lot-Sizing with a Bottleneck / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Multi-Item Capacitated Lot Size Problem: Error Bounds of Manne's Formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of the Capacitated Lot Size Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic capacitated lot-sizing problems: a classification and review of solution approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane approach to capacitated lot-sizing with start-up costs / 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: A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time / 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: Deterministic Production Planning with Concave Costs and Capacity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Production Planning: Algorithms and Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixing mixed-integer inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved lower bounds for the capacitated lot sizing problem with setup times. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lot Sizing in General Assembly Systems with Setup Costs, Setup Times, and Multiple Constrained Resources / 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: Approximation Algorithms for the Capacitated Multi-Item Lot-Sizing Problem via Flow-Cover Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The uncapacitated lot-sizing problem with sales and safety stocks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 0-1 knapsack problem with a single continuous variable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aggregation and Mixed Integer Rounding to Solve MIPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the polyhedral structure of a multi-item production planning model with setup times / 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: Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedra for lot-sizing with Wagner-Whitin costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Production Planning by Mixed Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifted inequalities for 0-1 mixed integer programming: superlinear lifting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling multiple stage manufacturing systems with generalized costs and capacity issues / 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: A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Heuristic for Production Planning Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach / rank
 
Normal rank

Revision as of 04:31, 6 July 2024

scientific article
Language Label Description Also known as
English
A computational analysis of lower bounds for big bucket production planning problems
scientific article

    Statements

    A computational analysis of lower bounds for big bucket production planning problems (English)
    0 references
    0 references
    0 references
    18 February 2013
    0 references
    production planning
    0 references
    lot-sizing
    0 references
    integer programming
    0 references
    strong formulations
    0 references
    Lagrangian relaxation
    0 references
    0 references
    0 references
    0 references

    Identifiers