Best-first search methods for constrained two-dimensional cutting stock problems
Operations Research
Computers and Operations Research
A fast algorithm for assortment optimization problems
Computers and Operations Research
Computers and Industrial Engineering
A combined approach to the solution to the general one-dimensional cutting stock problem
Computers and Operations Research
A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
Operations Research
One-Dimensional Cutting Stock Optimization with Usable Leftover: A Case of Low Stock-to-Order Ratio
International Journal of Decision Support System Technology
Computers and Industrial Engineering
Hi-index | 0.00 |
Due to lack of efficient approaches of mixed production, the present production approach of the TFT-LCD industry is batch production that each glass substrate is cut into LCD plates of one size only. This study proposes an optimization algorithm for cutting stock problems of the TFT-LCD industry. The proposed algorithm minimizes the number of glass substrates required to satisfy the orders, therefore reducing the production costs. Additionally, the solution of the proposed algorithm is a global optimum which is different from a local optimum or a feasible solution that is found by the heuristic algorithm. Numerical examples are also presented to illustrate the usefulness of the proposed algorithm.