Utilize este identificador para referenciar este registo: http://hdl.handle.net/10400.22/5827
Título: Minimization of open orders using interval graphs
Autor: Lopes, Isabel Cristina
Carvalho, J. M. Valerio de
Palavras-chave: Integer programming
Interval graphs
Open orders minimization
MOSP
Pathwidth
Data: 2010
Relatório da Série N.º: ;4
Resumo: In this paper we address an order processing optimization problem known as the Minimization of Open Stacks Problem (MOSP). This problem consists in finding the best sequence for manufacturing the different products required by costumers, in a setting where only one product can be made at a time. The objective is to minimize the maximum number of incomplete orders from costumers that are being processed simultaneously. We present an integer programming model, based on the existence of a perfect elimination order in interval graphs, which finds an optimal sequence for the costumers orders. Among other economic advantages, manufacturing the products in this optimal sequence reduces the amount of space needed to store incomplete orders.
Peer review: yes
URI: http://hdl.handle.net/10400.22/5827
ISSN: 1992-9978
Versão do Editor: http://www.iaeng.org/IJAM/issues_v40/issue_4/IJAM_40_4_11.pdf
Aparece nas colecções:ESEIG - MAT - Artigos

Ficheiros deste registo:
Ficheiro Descrição TamanhoFormato 
ART_IsabelLopes_2010_1.pdf668,07 kBAdobe PDFVer/Abrir


FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpace
Formato BibTex MendeleyEndnote Degois 

Todos os registos no repositório estão protegidos por leis de copyright, com todos os direitos reservados.