Mixed integer programming model formulations for dynamic multi-item multi-level capacitated lotsizing
type: Item
instance of: scholarly article
title: Mixed integer programming model formulations for dynamic multi-item multi-level capacitated lotsizing
zbMATH Open document ID: 0947.90541
DOI: 10.1016/0377-2217(95)00094-1
author: Hartmut Stadtler
published in: European Journal of Operational Research
publication date: 1999-02-22T00:00:00Z
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 1252919
zbMATH Keywords: production planning
zbMATH Keywords: lotsize
zbMATH Keywords: mathematical programming
describes a project that uses: Mlclsp
MaRDI profile type: Publication
full work available at URL: 0377-2217(95)00094-1
OpenAlex ID: W2094228709
cites work: Mathematical Programming Approaches to Capacity-Constrained MRP Systems: Review, Formulation and Problem Reduction
cites work: Computational Complexity of the Capacitated Lot Size Problem
cites work: Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
cites work: Q4139966
cites work: Multilevel capacitated lotsizing complexity and LP-based heuristics
cites work: Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes
cites work: Statistical search methods for lotsizing problems
cites work: A heuristic for dynamic multi-item multi-level capacitated lotsizing for general product structures
cites work: Multi-level multi-item lot size planning with limited resources and general manufacturing structure.
cites work: From EOQ Towards ZI
description: scientific article; zbMATH DE number 1252919