Repository logo
 
Loading...
Thumbnail Image
Publication

Using interval graphs in an order processing optimization problem

Use this identifier to reference this record.
Name:Description:Size:Format: 
COM_IsabelLopes_2010_3.pdf644.57 KBAdobe PDF Download

Advisor(s)

Abstract(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.

Description

Keywords

Integer programming Interval graphs Open orders minimization MOSP Pathwidth

Citation

Research Projects

Organizational Units

Journal Issue

Publisher

International Association of Engineers

CC License