A carregar...
Publicação
An integer programming framework for sequencing cutting patterns based on interval graph completion
| Nome: | Descrição: | Tamanho: | Formato: | |
|---|---|---|---|---|
| 2.55 MB | Adobe PDF |
Orientador(es)
Resumo(s)
We derived a framework in integer programming, based on the properties of a
linear ordering of the vertices in interval graphs, that acts as an edge completion model for
obtaining interval graphs. This model can be applied to problems of sequencing cutting
patterns, namely the minimization of open stacks problem (MOSP). By making small
modifications in the objective function and using only some of the inequalities, the MOSP
model is applied to another pattern sequencing problem that aims to minimize, not only the number of stacks, but also the order spread (the minimization of the stack occupation problem), and the model is tested.
Descrição
Palavras-chave
Integer programming Interval graphs Sequencing cutting patterns