Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost
From MaRDI portal
Publication:2171594
DOI10.1016/j.ejor.2022.04.023OpenAlexW4224224966MaRDI QIDQ2171594
Silvio Alexandre de Araujo, Eduardo M. Silva, Kerem Akartunalı, Gislaine Mara Melega
Publication date: 9 September 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2022.04.023
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mathematical models and a heuristic method for the multiperiod one-dimensional cutting stock problem
- Pattern-set generation algorithm for the one-dimensional cutting stock problem with setup cost
- Relaxations for two-level multi-item lot-sizing problems
- Cutting stock with no three parts per pattern: work-in-process and pattern minimization
- Integrating process optimization and inventory planning in cutting-stock with skiving option: an optimization model and its application
- Classification and literature review of integrated lot-sizing and cutting stock problems
- Enforcing minimum run length in the cutting stock problem
- The combined cutting stock and lot-sizing problem in industrial processes
- One-dimensional cutting stock optimization in consecutive time periods
- A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
- An integrated approach to the one-dimensional cutting stock problem in coronary stent manufacturing
- The one-dimensional cutting stock problem with due dates
- CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
- Exact solution of bin-packing problems using column generation and branch-and-bound
- A new model for complete solutions to one-dimensional cutting stock problems.
- An exact optimization approach for an integrated process configuration, lot-sizing, and scheduling problem
- The integrated lot sizing and cutting stock problem with saw cycle constraints applied to furniture production
- Combined cutting stock and lot-sizing problem with pattern setup
- Two-dimensional cutting stock problem with sequence dependent setup times
- Single-item dynamic lot-sizing problems: an updated survey
- Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: zero setup case
- LP models for bin packing and cutting stock problems
- One-dimensional cutting stock problem to minimize the number of different patterns
- Pattern minimisation in cutting stock problems
- A combined cutting-stock and lot-sizing problem
- Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost
- Robust formulations for economic lot-sizing problem with remanufacturing
- An extended goal programming model for the multiobjective integrated lot-sizing and cutting stock problem
- A comparison of formulations for a three-level lot sizing and replenishment problem with a distribution structure
- A multi-stage stochastic integer programming approach for a multi-echelon lot-sizing problem with returns and lost sales
- Worst case analysis of relax and fix heuristics for lot-sizing problems
- One-dimensional stock cutting: optimization of usable leftovers in consecutive orders
- Risk-averse two-stage stochastic programs in furniture plants
- Lot sizing and furnace scheduling in small foundries
- Solving a combined cutting-stock and lot-sizing problem with a column generating procedure
- A hybrid heuristic to reduce the number of different patterns in cutting stock problems
- An improved typology of cutting and packing problems
- An optimization model for trim loss minimization in an automotive glass plant
- Mathematical Methods of Organizing and Planning Production
- Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems
- On LP relaxations for the pattern minimization problem
- Solving a bi-criterion cutting stock problem with open-ended demand: a case study
- A branch-and-price-and-cut algorithm for the pattern minimization problem
- A Linear Programming Approach to the Cutting-Stock Problem
- A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times
- COMBINING PROCESS SELECTION AND LOT SIZING MODELS FOR PRODUCTION SCHEDULING OF ELECTROFUSED GRAINS
- Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times
- Reformulation and Decomposition of Integer Programs
- Strong Formulations for Multi-Item Capacitated Lot Sizing
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- Selection and Design of Heuristic Procedures for Solving Roll Trim Problems
- Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
- A Cutting Stock and Scheduling Problem in the Copper Industry
- Multiechelon Lot Sizing: New Complexities and Inequalities
- Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines
- The Meet-in-the-Middle Principle for Cutting and Packing Problems
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- Cutting Stock Problems
This page was built for publication: Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost
