A multi-objective programming approach to 1.5-dimensional assortment problem

A multi-objective programming approach to 1.5-dimensional assortment problem

0.00 Avg rating0 Votes
Article ID: iaor2009374
Country: Netherlands
Volume: 179
Issue: 1
Start Page Number: 64
End Page Number: 79
Publication Date: May 2007
Journal: European Journal of Operational Research
Authors: , ,
Keywords: programming: multiple criteria
Abstract:

In this paper we study a 1.5-dimensional cutting stock and assortment problem which includes determination of the number of different widths of roll stocks to be maintained as inventory and determination of how these roll stocks should be cut by choosing the optimal cutting pattern combinations. We propose a new multi-objective mixed integer linear programming model in the form of simultaneously minimization two contradicting objectives related to the trim loss cost and the combined inventory cost in order to fulfill a given set of cutting orders. An equivalent nonlinear version and a particular case related to the situation when a producer is interested in choosing only a few number of types among all possible roll sizes, have also been considered. A new method called the conic scalarization is proposed for scalarizing non-convex multi-objective problems.

Reviews

Required fields are marked *. Your email address will not be published.