Using interval graphs in an order processing optimization problem
| Data(s) |
24/04/2015
24/04/2015
2010
|
|---|---|
| Resumo |
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. |
| Identificador |
978-988-18210-8-9 2078-0958 e-ISSN 2078-0966 |
| Idioma(s) |
eng |
| Publicador |
International Association of Engineers |
| Direitos |
openAccess |
| Palavras-Chave | #Integer programming #Interval graphs #Open orders minimization #MOSP #Pathwidth |
| Tipo |
conferenceObject |
