Sequencing Cutting Patterns with Colored Interval Graphs
| Autor: | Isabel Cristina Lopes, J. M. Valério de Carvalho |
|---|---|
| Rok vydání: | 2010 |
| Předmět: |
021103 operations research
0211 other engineering and technologies 0102 computer and information sciences 02 engineering and technology Workspace Flat glass 01 natural sciences Graph Combinatorics Wood panel Integer programming model Colored 010201 computation theory & mathematics Minification Integer programming Mathematics |
| Zdroj: | IFAC Proceedings Volumes. 43:58-63 |
| ISSN: | 1474-6670 |
| DOI: | 10.3182/20100908-3-pt-3007.00014 |
| Popis: | The problem addressed here originates in the industry of flat glass cutting and wood panel sawing, where smaller items are cut from larger items accordingly to predefined cutting patterns. In this type of industry the smaller pieces that are cut from the patterns are piled around the machine in stacks according to the size of the pieces, which are moved to the warehouse only when all items of the same size have been cut. If the cutting machine can process only one pattern at a time, and the workspace is limited, it is desirable to set the sequence in which the cutting patterns are processed in a way to minimize the maximum number of open stacks around the machine. This problem is known in literature as the minimization of open stacks (MOSP). To find the best sequence of the cutting patterns, we propose an integer programming model, based on interval graphs, that searches for an appropriate edge completion of the given graph of the problem, while defining a suitable coloring of its vertices. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|