Article ID: | iaor20001904 |
Country: | United Kingdom |
Volume: | 26 |
Issue: | 13 |
Start Page Number: | 1323 |
End Page Number: | 1333 |
Publication Date: | Nov 1999 |
Journal: | Computers and Operations Research |
Authors: | Trietsch Dan, Robb David J. |
Keywords: | bin packing, greeting cards, printing |
We develop a polynomial-time algorithm to optimise a variant of the one-dimensional bin-packing problem with side constraints. We also develop a pseudo-polynomial procedure to actually implement that optimal solution. The specific application is the allocation of excess of a population of various types of cards (e.g., left over from a previous selling season) to fixed-sized ‘variety packs’ which guarantee a given level of variety (i.e., no more than