?url_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Adc&rft.relation=http%3A%2F%2Fmiis.maths.ox.ac.uk%2Fmiis%2F45%2F&rft.title=Optimal+sorting+of+product+into+fixed+weight+packaging&rft.creator=Marsh%2C+Clive&rft.creator=Kilby%2C+Philip&rft.subject=Food+and+Drink&rft.subject=Retail&rft.description=Compac+Sorting+Equipment+make+very+nifty+machines+for+sorting+fruit+by+weight%2C+diameter%2C+colour%2C+density%2C+blemish+or+even+shape.+Compac+sought+solutions+to+two+closely+related+problems%3A+the+boxing+problem+and+the+bagging+problem.+%0A%0AThe+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%2C+but+before+the+fruit+passes+the+first+outlet+-+a+few+seconds+total.+Further%2C+information+about+fruit+already+packed+in+a+given+box+is+incomplete+(we+don%E2%80%99t+know+exactly+which+fruit+ended+up+in+a+box).+%0A%0AThe+bagging+problem+requires+bags+to+be+filled+to+a+minimum+weight+-+no+tolerance+for+underweights%2C+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.&rft.date=2004&rft.type=Study+Group+Report&rft.type=NonPeerReviewed&rft.format=application%2Fpdf&rft.language=en&rft.identifier=http%3A%2F%2Fmiis.maths.ox.ac.uk%2Fmiis%2F45%2F2%2Fmisg2004sorting.pdf&rft.format=application%2Fpdf&rft.language=en&rft.identifier=http%3A%2F%2Fmiis.maths.ox.ac.uk%2Fmiis%2F45%2F3%2Fmisg2004sorting_efs.pdf&rft.identifier=++Marsh%2C+Clive+and+Kilby%2C+Philip++(2004)+Optimal+sorting+of+product+into+fixed+weight+packaging.++%5BStudy+Group+Report%5D+++++&rft.relation=http%3A%2F%2Fmiis.maths.ox.ac.uk%2Fpast%2FMISG%2F2004%2F