S1401-1-5 Dynamic Programming Algorithms for Duplex Food Packing Problems

Abstract

In this paper, we deal with a duplex packing operation such that an automatic combination weigher chooses two disjoint subsets l' and l" from the set l of the current n items to produce two packages of foods. The primary objective of lexicographic bi-criteria duplex food packing problem is to minimize the total weight of chosen items for two packages, making the total weight of each package no less than a specified target weight T. The second objective is to maximize the total priority of chosen items for two packages. The priority of an item is given as its duration in hopper. We prove that the lexicographic bi-criteria duplex food packing problem can be solved in O(nT^2) time by dynamic programming if all input data are integral.