A carregar...
Publicação
Using interval graphs in an order processing optimization problem
| Nome: | Descrição: | Tamanho: | Formato: | |
|---|---|---|---|---|
| 644.57 KB | Adobe PDF |
Orientador(es)
Resumo(s)
In this paper we address an order processing optimization problem known as minimization of open stacks (MOSP). We present an integer pro
gramming model, based on the existence of a perfect elimination scheme in interval graphs, which finds an optimal sequence for the costumers orders.
Descrição
Palavras-chave
Integer programming Interval graphs Open orders minimization MOSP Pathwidth
Contexto Educativo
Citação
Editora
International Association of Engineers