eprintid: 45
rev_number: 5
eprint_status: archive
userid: 4
dir: disk0/00/00/00/45
datestamp: 2005-05-26
lastmod: 2015-05-29 19:46:03
status_changed: 2009-04-08 16:52:29
type: report
metadata_visibility: show
item_issues_count: 0
creators_name: Marsh, Clive
creators_name: Kilby, Philip
title: Optimal sorting of product into fixed weight packaging
ispublished: pub
subjects: food
subjects: retail
studygroups: misg21
companyname: Compac Sorting Equipment
full_text_status: public
abstract: Compac Sorting Equipment make very nifty machines for sorting fruit by weight, diameter, colour, density, blemish or even shape. Compac sought solutions to two closely related problems: the boxing problem and the bagging problem. 

The boxing problem requires graded fruit to be assigned to outlets where boxes are filled with a specified number of fruit to a minimum weight (and a specified tolerance for underweights). The aim is to maximise the number of boxes packed. The decision must be made after all information is known, but before the fruit passes the first outlet - a few seconds total. Further, information about fruit already packed in a given box is incomplete (we don’t know exactly which fruit ended up in a box). 

The bagging problem requires bags to be filled to a minimum weight - no tolerance for underweights, and no constraints on the number of fruit per bag. In this case complete information is available on fruit already assigned to a bag. Again the aim is to maximise the number of bags packed.
date: 2004
date_type: published
pages: 3
official_url: http://miis.maths.ox.ac.uk/past/MISG/2004/
citation:   Marsh, Clive and Kilby, Philip  (2004) Optimal sorting of product into fixed weight packaging.  [Study Group Report]     
document_url: http://miis.maths.ox.ac.uk/miis/45/2/misg2004sorting.pdf
document_url: http://miis.maths.ox.ac.uk/miis/45/3/misg2004sorting_efs.pdf