Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost
type: Item
instance of: scholarly article
title: Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost
zbMATH Open document ID: 1458.90552
author: Ning Ma
author: Ya Liu
author: Zhili Zhou
published in: Computers \& Operations Research
publication date: 2019-07-09T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7077675
zbMATH Keywords: multiperiod
zbMATH Keywords: cutting stock
zbMATH Keywords: pattern setup
zbMATH Keywords: mathematical models
zbMATH Keywords: heuristics
describes a project that uses: CUTGEN1
describes a project that uses: Knapsack
MaRDI profile type: Publication
full work available at URL: j.cor.2019.05.013
OpenAlex ID: W2946432934
cites work: A branch-and-price-and-cut algorithm for the pattern minimization problem
cites work: Integrating process optimization and inventory planning in cutting-stock with skiving option: an optimization model and its application
cites work: Exact solution of bin-packing problems using column generation and branch-and-bound
cites work: LP models for bin packing and cutting stock problems
cites work: Pattern-set generation algorithm for the one-dimensional cutting stock problem with setup cost
cites work: A fix-and-optimize heuristic for the high school timetabling problem
cites work: Packing problems
cites work: A typology of cutting and packing problems
cites work: Pattern reduction in one-dimensional cutting stock problems
cites work: CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
cites work: A Linear Programming Approach to the Cutting-Stock Problem
cites work: The combined cutting stock and lot-sizing problem in industrial processes
cites work: A linear optimization approach to the combined production planning model
cites work: The trim-loss and assortment problems: A survey
cites work: Mathematical methods of organizing and planning production. English translation by Robert W. Campbell and W. H. Marlow
cites work: Two-dimensional packing problems: a survey
cites work: Pattern minimisation in cutting stock problems
cites work: Classification and literature review of integrated lot-sizing and cutting stock problems
cites work: Solution approaches for the cutting stock problem with setup cost
cites work: Combined cutting stock and lot-sizing problem with pattern setup
cites work: A combined cutting-stock and lot-sizing problem
cites work: Furniture supply chain tactical planning optimization using a time decomposition approach
cites work: A Minimal Algorithm for the 0-1 Knapsack Problem
cites work: Mathematical models and a heuristic method for the multiperiod one-dimensional cutting stock problem
cites work: Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths
cites work: A coupling cutting stock-lot sizing problem in the paper industry
cites work: Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
cites work: The integrated lot sizing and cutting stock problem with saw cycle constraints applied to furniture production
cites work: Heuristics for the integer one-dimensional cutting stock problem: A computational study
cites work: An improved typology of cutting and packing problems
cites work: Progressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock Problem
Wikidata QID: Q127891532
DOI: 10.1016/J.COR.2019.05.013
description: scientific article; zbMATH DE number 7077675