Two-dimensional cutting stock problem with sequence dependent setup times
type: Item
instance of: scholarly article
title: Two-dimensional cutting stock problem with sequence dependent setup times
zbMATH Open document ID: 1374.90277
author: Peng Zhang
published in: European Journal of Operational Research
publication date: 2017-11-23T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90B90
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6811937
zbMATH Keywords: cutting stock problem
zbMATH Keywords: sequence dependent setup times
zbMATH Keywords: heuristics
zbMATH Keywords: application
MaRDI profile type: Publication
full work available at URL: j.ejor.2017.07.036
OpenAlex ID: W2734378098
Wikidata QID: Q47036966
cites work: Pattern-set generation algorithm for the one-dimensional cutting stock problem with setup cost
cites work: Bin packing and cutting stock problems: mathematical models and exact algorithms
cites work: A Linear Programming Approach to the Cutting Stock Problem—Part II
cites work: Multistage Cutting Stock Problems of Two and More Dimensions
cites work: A Linear Programming Approach to the Cutting-Stock Problem
cites work: Controlling Cutting Pattern Changes in One-Dimensional Trim Problems
cites work: Q5538306
cites work: Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges
cites work: Selected Topics in Column Generation
cites work: Solution approaches for the cutting stock problem with setup cost
cites work: The one-dimensional cutting stock problem with due dates
cites work: A two-dimensional strip cutting problem with sequencing constraint
cites work: An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem
cites work: One-dimensional cutting stock problem to minimize the number of different patterns
cites work: An improved typology of cutting and packing problems
cites work: On a pattern sequencing problem to minimize the maximum number of open stacks
cites work: An integrated cutting stock and sequencing problem
cites work: Establishing the optimality of sequencing heuristics for cutting stock problems
DOI: 10.1016/J.EJOR.2017.07.036
description: scientific article; zbMATH DE number 6811937