Lopes, Isabel CristinaCarvalho, J. M. Valerio de2015-04-242015-04-242010978-988-18210-8-92078-0958e-ISSN 2078-0966http://hdl.handle.net/10400.22/5834In 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.engInteger programmingInterval graphsOpen orders minimizationMOSPPathwidthUsing interval graphs in an order processing optimization problemconference object