MINLP formulations for solving strip packing problems in LCD mother glass production

► We formulate the original model which is a non-convex MINLP. ► We transform the non-convex MINLP into MILP and convex MINLP. ► The two-step formulation can solve the 2SP in given computational time. Mother glass production for liquid crystal displays involves the cutting of small rectangles from a...

Full description

Saved in:
Bibliographic Details
Published in:Computers & chemical engineering Vol. 48; pp. 312 - 324
Main Authors: Park, Kyung Tae, Kim, Hansol, Lee, Soobin, Lee, Ho-Kyung, Ryu, Jun-hyung, Lee, In-Beum
Format: Journal Article
Language:English
Published: Elsevier Ltd 01.01.2013
Subjects:
LCD mother glass production optimization
Mixed integer non-linear programming
Trim loss problems
Mixed integer non-linear programming
LCD mother glass production optimization
Trim loss problems
ISSN:0098-1354, 1873-4375
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:► We formulate the original model which is a non-convex MINLP. ► We transform the non-convex MINLP into MILP and convex MINLP. ► The two-step formulation can solve the 2SP in given computational time. Mother glass production for liquid crystal displays involves the cutting of small rectangles from a large rectangle (strip) to minimize the length of the strip used. This is called the strip packing problem. The main concept for formulating this problem is to generate cutting patterns that can be used to produce items from the strip. This problem is a non-convex mixed integer nonlinear programming (MINLP) problem due to the bilinear terms in the demand and objective function. To obtain global optimal solutions, this problem should be transformed into several linear forms. Numerical examples based on the strip packing problem in LCD mother glass production are provided. Different objective functions for two problems are presented and compared.
ISSN:0098-1354
1873-4375
DOI:10.1016/j.compchemeng.2012.09.003