An analysis of the integrated lot-sizing and cutting-stock problem formulation
type: Item
instance of: scholarly article
title: An analysis of the integrated lot-sizing and cutting-stock problem formulation
zbMATH Open document ID: 1481.90031
author: Livia Maria Pierini
author: Kelly Cristina Poldi
published in: Applied Mathematical Modelling
publication date: 2021-09-21T00:00:00Z
Mathematics Subject Classification ID: 90B05
Mathematics Subject Classification ID: 90B30
zbMATH DE Number: 7398131
zbMATH Keywords: lot-sizing problem
zbMATH Keywords: cutting-stock problem
zbMATH Keywords: column generation
zbMATH Keywords: relax-and-fix heuristic
MaRDI profile type: Publication
full work available at URL: j.apm.2021.06.009
OpenAlex ID: W3176098416
cites work: Modeling industrial lot sizing problems: a review
cites work: Simultaneous lotsizing and scheduling problems: a classification and review of models
cites work: Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: zero setup case
cites work: An improved typology of cutting and packing problems
cites work: Preface to the special issue on cutting and packing
cites work: Bin packing and cutting stock problems: mathematical models and exact algorithms
cites work: The integrated lot sizing and cutting stock problem with saw cycle constraints applied to furniture production
cites work: Mathematical methods of organizing and planning production. English translation by Robert W. Campbell and W. H. Marlow
cites work: A combined cutting-stock and lot-sizing problem
cites work: The combined cutting stock and lot-sizing problem in industrial processes
cites work: Risk-averse two-stage stochastic programs in furniture plants
cites work: Combined cutting stock and lot-sizing problem with pattern setup
cites work: Classification and literature review of integrated lot-sizing and cutting stock problems
cites work: A coupling cutting stock-lot sizing problem in the paper industry
cites work: Reel and sheet cutting at a paper mill
cites work: Decomposition methods for the lot-sizing and cutting-stock problems in paper industries
cites work: Q4198056
cites work: Computational Complexity of the Capacitated Lot Size Problem
cites work: A suggested computation for maximal multi-commodity network flows
cites work: Q3993418
cites work: A Linear Programming Approach to the Cutting-Stock Problem
cites work: Production Planning by Mixed Integer Programming
DOI: 10.1016/J.APM.2021.06.009
description: scientific article; zbMATH DE number 7398131