Progress with single-item lot-sizing (Q1390225): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Optimal Lot-Sizing Algorithms for Complex Product Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Algorithms for Economic Lot Size Problems / 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: Strong Formulations for Multi-Item Capacitated Lot Sizing / 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: A cutting plane approach to capacitated lot-sizing with start-up costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Large-Scale Zero-One Linear Programming Problems / 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: The discrete lot-sizing and scheduling problem / 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: The Deterministic Dynamic Product Cycling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4139966 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Facilities in Series Inventory Model with Nested Schedules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating Alternative Mixed-Integer Programming Models Using Variable Redefinition / 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: Lot-Sizing with Constant Batches: Formulation and Valid Inequalities / 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: Q4840775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Column-Generation Based Tactical Planning Method for Inventory Routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral Characterization of the Economic Lot-Sizing Problem with Start-Up Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear description of the discrete lot-sizing and scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Version of the Economic Lot Size Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Concave Cost Flows in Certain Networks / 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

Latest revision as of 13:09, 28 May 2024

scientific article
Language Label Description Also known as
English
Progress with single-item lot-sizing
scientific article

    Statements

    Progress with single-item lot-sizing (English)
    0 references
    0 references
    14 July 1998
    0 references
    The goal in this talk is to look at the history of the single-item uncapacitated lot-sizing (ULS) problem that was apparently well-solved in 1958, and point out a variety of new results that have been obtained in the last few years. The outline of the talk is as follows. First we present the simplest multi-item model of practical interest and indicate how various solution algorithms lead naturally to ULS subproblems. We then take a historical viewpoint starting in 1958. In Section 3 (1958-1975) we describe the basic results of Wagner-Whitin on the structure of optimal solutions leading to a dynamic programming algorithm. We then mention briefly some of the important extensions to the model analyzed up to the early 70's. In Section 4 (1975-1990) we describe some important reformulations either involving additional variables or the addition of valid inequalities, and indicate also how they can be used in practice. In Section 5 (1990-present) we cite some surprising new results, in particular the improvements in the dynamic programming algorithm and the simplification of the formulations when a ``Wagner-Whitin'' cost structure is present. We terminate with a brief indication of work in progress on some of the more important extensions to ULS, namely models with capacities and start-up costs and times, as well as a new profit-maximizing variant of the ULS model.
    0 references
    0 references
    single-item uncapacitated lot-sizing
    0 references
    dynamic programming
    0 references
    valid inequalities
    0 references
    0 references
    0 references
    0 references