Name: | Description: | Size: | Format: | |
---|---|---|---|---|
644.57 KB | Adobe PDF |
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
Publisher
International Association of Engineers