Mathematical Modeling and Optimal Blank Generation in Glass Manufacturing. (27th April 2014)

• Record Type: Journal Article
• Authors: Phillips, Raymond; Woolway, Matthew; Fanucchi, Dario; Ali, M. Montaz
• Other Names: Adewumi Aderemi Oluyinka Academic Editor.
• Is Part Of: Journal of applied mathematics. Volume 2014(2014)
• Publication Date: 2014-04-27
• Subjects: Mathematics -- Periodicals; 519.05
• DOI: 10.1155/2014/959453
• Languages: English
• ISSNs: 1110-757X

Abstract

Abstract : This paper discusses the stock size selection problem (Chambers and Dyson, 1976), which is of relevance in the float glass industry. Given a fixed integer N, generally between 2 and 6 (but potentially larger), we find the N best sizes for intermediate stock from which to cut a roster of orders. An objective function is formulated with the purpose of minimizing wastage, and the problem is phrased as a combinatorial optimization problem involving the selection of columns of a cost matrix. Some bounds and heuristics are developed, and two exact algorithms (depth-first search and branch-and-bound) are applied to the problem, as well as one approximate algorithm (NOMAD). It is found that wastage reduces dramatically as N increases, but this trend becomes less pronounced for larger values of N (beyond 6 or 7). For typical values of N, branch-and-bound is able to find the exact solution within a reasonable amount of time.