Minimization of open orders using interval graphs

Lopes, Isabel Cristina; Carvalho, J. M. Valerio de

http://hdl.handle.net/10400.22/5827

Utilize este identificador para referenciar este registo.

Nome:	Descrição:	Tamanho:	Formato:
ART_IsabelLopes_2010_1.pdf		668.07 KB	Adobe PDF	Ver/Abrir

Contacte-nos

Autores

Lopes, Isabel Cristina

Carvalho, J. M. Valerio de

Resumo(s)

In this paper we address an order processing optimization problem known as the Minimization of Open Stacks Problem (MOSP). This problem consists in ﬁnding the best sequence for manufacturing the diﬀerent 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 ﬁnds 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.

Palavras-chave

Integer programming Interval graphs Open orders minimization MOSP Pathwidth

URI

http://hdl.handle.net/10400.22/5827

Coleções

ESEIG - MAT - Artigos

Ver registo completo