A heuristic approach to minimize the number of saw cycles in small-scale furniture factories
From MaRDI portal
Publication:1686524
DOI10.1007/s10479-015-1955-9zbMath1381.90035OpenAlexW1059229845MaRDI QIDQ1686524
Alyne Toscano, Socorro Rangel, Horacio Hideki Yanasse
Publication date: 15 December 2017
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11449/171124
column generationheuristictwo-dimensional cutting stockfurniture productionmachine productivitysaw cycles
Related Items (5)
The integrated lot sizing and cutting stock problem with saw cycle constraints applied to furniture production ⋮ An MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts ⋮ An extended goal programming model for the multiobjective integrated lot-sizing and cutting stock problem ⋮ Modeling and solving a real-world cutting stock problem in the marble industry via mathematical programming and stochastic diffusion search approaches ⋮ Classification and literature review of integrated lot-sizing and cutting stock problems
Uses Software
Cites Work
- Unnamed Item
- 2DCPackGen: a problem generator for two-dimensional rectangular cutting and packing problems
- Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges
- Using the primal-dual interior point algorithm within the branch-price-and-cut method
- Solution approaches for the cutting stock problem with setup cost
- Bun splitting: a practical cutting stock problem
- Enforcing minimum run length in the cutting stock problem
- Nonlinear cutting stock problem model to minimize the number of different patterns and objects
- Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths
- New lower bounds based on column generation and constraint programming for the pattern minimization problem
- Column enumeration based decomposition techniques for a class of non-convex MINLP problems
- A typology of cutting and packing problems
- Alternative formulations for a layout problem in the fashion industry
- Heuristics for the integer one-dimensional cutting stock problem: A computational study
- Pattern minimisation in cutting stock problems
- Order and static stability into the strip packing problem
- The one-dimensional cutting stock problem with usable leftovers -- a survey
- A hybrid heuristic to reduce the number of different patterns in cutting stock problems
- An improved typology of cutting and packing problems
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- A Mixed Integer Programming Model for Solving a Layout Problem in the Fashion Industry
- Two-dimensional Cutting Stock with Multiple Stock Sizes
- A note on linear models for two-group and three-group two-dimensional guillotine cutting problems
- Controlling Cutting Pattern Changes in One-Dimensional Trim Problems
- Pattern reduction in one-dimensional cutting stock problems
- Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
- Approximation Algorithms to Solve Real-Life Multicriteria Cutting Stock Problems
- O problema de corte de estoque em indústrias de móveis de pequeno e médio portes
- Multistage Cutting Stock Problems of Two and More Dimensions
- The Theory and Computation of Knapsack Functions
This page was built for publication: A heuristic approach to minimize the number of saw cycles in small-scale furniture factories
