A dynamic programming based heuristic for industrial buying of cardboard

A dynamic programming based heuristic for industrial buying of cardboard

0.00 Avg rating0 Votes
Article ID: iaor1989296
Country: Netherlands
Volume: 38
Issue: 1
Start Page Number: 104
End Page Number: 112
Publication Date: Jan 1989
Journal: European Journal of Operational Research
Authors: ,
Keywords: programming: dynamic
Abstract:

A heuristic method is proposed for a deterministic two-dimensional assortment problem with a large number of different sizes. The method is applied using real-world data for cardboard buying. It is found to give satisfactory results in comparison with both the current company policy and results obtained by an existing heuristic.

Reviews

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