Single item lot sizing problems (Q2566041)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Single item lot sizing problems	scientific article

Statements

scholarly article

0 references

Single item lot sizing problems (English)

0 references

0 references

Stéphane Dauzère-Pérès

0 references

0 references

0 references

European Journal of Operational Research

0 references

publication date

22 September 2005

0 references

zbMATH Keywords

Production

0 references

Planning

0 references

Lot-sizing

0 references

Single item

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.ejor.2004.01.054

0 references

Optimal Lot-Sizing Algorithms for Complex Product Structures

0 references

Improved Algorithms for Economic Lot Size Problems

0 references

An Algorithm for the Dynamic Lot-Size Problem with Time-Varying Production Capacity Constraints

0 references

Strong Formulations for Multi-Item Capacitated Lot Sizing

0 references

bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems

0 references

Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs

0 references

Heuristics for Multilevel Lot-Sizing with a Bottleneck

0 references

The Multi-Item Capacitated Lot Size Problem: Error Bounds of Manne's Formulations

0 references

0 references

Computational Complexity of the Capacitated Lot Size Problem

0 references

Set partitioning and column generation heuristics for capacitated dynamic lotsizing

0 references

A new dynamic programming algorithm for the single item capacitated dynamic lot size model

0 references

Analysis of relaxations for the multi-item capacitated lot-sizing problem

0 references

An <i>O</i>(<i>T</i><sup>2</sup>) Algorithm for the <i>NI</i>/<i>G</i>/<i>NI</i>/<i>ND</i> Capacitated Lot Size Problem

0 references

An effective algorithm for the capacitated single item lot size problem

0 references

An integrated approach in production planning and scheduling

0 references

Integration of lotsizing and scheduling decisions in a job-shop

0 references

On the importance of sequencing decisions in production planning and scheduling

0 references

A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing

0 references

Lot sizing and scheduling -- survey and extensions

0 references

0 references

The Economic Lot Scheduling Problem (ELSP): Review and Extensions

0 references

Extensions of the Planning Horizon Theorem in the Dynamic Lot Size Model

0 references

Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition

0 references

A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time

0 references

The discrete lot-sizing and scheduling problem

0 references

Deterministic Production Planning with Concave Costs and Capacity Constraints

0 references

Deterministic Production Planning: Algorithms and Complexity

0 references

A Dynamic Lot-Size Model With Inventory Deterioration

0 references

A Fully Polynomial Approximation Scheme for Single-Product Scheduling in a Finite Capacity Facility

0 references

A Tabu-Search Heuristic for the Capacitated Lot-Sizing Problem with Set-up Carryover

0 references

A new characterization for the dynamic lot size problem with bounded inventory

0 references

0 references

Optimal EOQ Models for Deteriorating Items with Time-Varying Demand

0 references

Dynamic Economic Lot Size Model with Perishable Inventory

0 references

On the General Feasibility Test of Scheduling Lot Sizes for Several Products on One Machine

0 references

Lot Sizing in General Assembly Systems with Setup Costs, Setup Times, and Multiple Constrained Resources

0 references

A genetic algorithm for multi-level, multi-machine lot sizing and scheduling

0 references

0 references

An Integrated Model for Job-Shop Planning and Scheduling

0 references

A Dynamic Lot-Sizing Model with Demand Time Windows

0 references

Facets and algorithms for capacitated lot sizing

0 references

Dynamic knapsack sets and capacitated lot-sizing

0 references

An Algorithm for the Single-item Capacitated Lot-Sizing Problem with Concave Production and Holding Costs

0 references

Bounded Production and Inventory Models with Piecewise Concave Costs

0 references

Primal-dual approach to the single level capacitated lot-sizing problem

0 references

Planning Horizons for the Dynamic Lot Size Model: Zabel vs. Protective Procedures and Computational Results

0 references

Multilevel capacitated lotsizing complexity and LP-based heuristics

0 references

Multi-Item Single-Level Capacitated Dynamic Lot-Sizing Heuristics: A General Review

0 references

On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra

0 references

Perishable Inventory Theory: A Review

0 references

An optimal replenishment policy for deteriorating items with time-varying demand and partial-exponential type -- backlogging

0 references

Lot-size models with backlogging: Strong reformulations and cutting planes

0 references

Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes

0 references

Polyhedra for lot-sizing with Wagner-Whitin costs

0 references

Deterministic Capacity Expansion Under Deterioration

0 references

Remanufacturing planning for the reverse Wagner/Whitin models

0 references

Deterministic lotsizing models for production planning

0 references

Some Extensions of the Discrete Lotsizing and Scheduling Problem

0 references

Statistical search methods for lotsizing problems

0 references

A Forward Algorithm for the Capacitated Lot Size Model with Stockouts

0 references

An Algorithm for Single-Item Capacitated Economic Lot Sizing with Piecewise Linear Production Costs and General Holding Costs

0 references

Optimum Solution Structure for a Repairable Inventory Problem

0 references

A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times

0 references

0 references

An <i>O</i>(<i>T</i><sup>3</sup>) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities

0 references

Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems

0 references

The single-item discrete lotsizing and scheduling problem: Optimization by linear and dynamic programming

0 references

Lot-Sizing with Start-Up Times

0 references

Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case

0 references

Dynamic Version of the Economic Lot Size Model

0 references

Progress with single-item lot-sizing

0 references

The economic lot scheduling problem under power-of-two policy

0 references

A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/j.ejor.2004.01.054

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2566041

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2566041&oldid=34420688"