Deterministic model for customized pilot manufacture production with various backplane sizes
From MaRDI portal
Publication:2310672
DOI10.1016/j.apm.2019.02.034zbMath1481.90156OpenAlexW2920031719WikidataQ128286815 ScholiaQ128286815MaRDI QIDQ2310672
Yao-Huei Huang, I-Fan Liu, Hao-Chun Lu
Publication date: 6 April 2020
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2019.02.034
deterministic methodtwo-dimensional cutting stock problemincremental encoding formulationpilot productionrange reduction technique
Cites Work
- Unnamed Item
- Unnamed Item
- An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry
- Models for the two-dimensional two-stage cutting stock problem with multiple stock size
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
- Multi-period mixed production planning with uncertain demands: fuzzy and interval fuzzy sets approach
- Recent advances on two-dimensional bin packing problems
- Exact algorithm for generating two-segment cutting patterns of punched strips
- Scheduling a hybrid flowshop with batch production at the last stage
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
- A heuristic for the container loading problem: A tertiary-tree-based dynamic space decomposition approach
- An analytical model for the container loading problem
- On genetic algorithms for the packing of polygons
- An approximately global optimization method for assortment problems
- A lower bound for the non-oriented two-dimensional bin packing problem
- The two-dimensional finite bin packing problem. II: New lower and upper bounds
- An efficient deterministic heuristic for two-dimensional rectangular packing
- A mixed-integer programming model for a class of assortment problems
- Approximately global optimization for assortment problems using piecewise linearization techniques
- Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem
- Decomposition methods for the lot-sizing and cutting-stock problems in paper industries
- A note on ``Reducing the number of binary variables in cutting stock problems
- Incremental and encoding formulations for mixed integer programming
- A new exact method for the two-dimensional bin-packing problem with fixed orientation
- The two-dimensional bin packing problem with variable bin sizes and costs
- An efficient deterministic optimization approach for rectangular packing problems
- A Set-Covering-Based Heuristic Approach for Bin-Packing Problems
- Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem
- Two-Dimensional Finite Bin-Packing Algorithms
- A distributed global optimization method for packing problems
- Base-2 Expansions for Linearizing Products of Functions of Discrete Variables
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
- Linear Reformulation of Polynomial Discrete Programming for Fast Computation
- New classes of fast lower bounds for bin packing problems
