Hybrid methods for lot sizing on parallel machines (Q342050): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-Price: Column Generation for Solving Huge Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual-Optimal Inequalities for Stabilized Column Generation / 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: Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133397 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Economic Lot Scheduling for Multiple Products on Parallel Identical Processors / 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 Dual Ascent and Column Generation Heuristic for the Discrete Lotsizing and Scheduling Problem with Setup Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition Principle for Linear Programs / 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: Dynamic Production Scheduling for a Process Industry / 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: Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: New developments in the primal-dual column generation technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Solution of the Single-item, Capacitated Lot-sizing Problem with Start-up and Reservation Costs / 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: Combining Column Generation and Lagrangian Relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Lot-Sizing Problems on Parallel Identical Machines Using Symmetry-Breaking Constraints / 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: Lotsizing and Scheduling on Parallel Machines with Sequence-Dependent Setup Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Algorithm for Multi-Item Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simultaneous lotsizing and scheduling on parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition approach for the general lotsizing and scheduling problem for parallel production lines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparing Dantzig–Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Extensions of the Discrete Lotsizing and Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical search methods for lotsizing problems / 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 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 Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Version of the Economic Lot Size Model / rank
 
Normal rank

Latest revision as of 22:55, 12 July 2024

scientific article
Language Label Description Also known as
English
Hybrid methods for lot sizing on parallel machines
scientific article

    Statements

    Hybrid methods for lot sizing on parallel machines (English)
    0 references
    0 references
    0 references
    17 November 2016
    0 references
    lot sizing
    0 references
    parallel machines
    0 references
    reformulation
    0 references
    hybrid methods
    0 references
    Dantzig-Wolfe decomposition
    0 references
    Lagrangian relaxation
    0 references
    0 references

    Identifiers