Dynamic programming and mixed integer programming based algorithms for the online glass cutting problem with defects and production targets

In flat glass manufacturing, glass products of various dimensions are cut from a glass ribbon that runs continuously on a conveyor belt. Placement of glass products on the glass ribbon is restricted by the defects of varying severity located on the ribbon as well as the quality grades of the product...

Full description

Saved in:

Bibliographic Details
Published in:	International journal of production research Vol. 55; no. 24; pp. 7398 - 7411
Main Authors:	Durak, Bahadır, Tuzun Aksu, Dilek
Format:	Journal Article
Language:	English
Published:	London Taylor & Francis 01.01.2017 Taylor & Francis LLC
Subjects:	Algorithms Belt conveyors Cutting cutting stock problem Defects Dynamic programming Glass & glassware industry glass manufacturing Integer programming Linear programming Mixed integer mixed integer programming online algorithm Quality quality grades Scrap
ISSN:	0020-7543, 1366-588X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!