We consider a generalized one-dimensional bin packing model in which the cost of a bin is a nondecreasing concave function of the utilization of the bin. We show that for any given positive constant [epsilon], there exists a polynomial-time approximation algorithm with an asymptotic worst-case...

Scheduling problems with processing set restrictions have been studied extensively by computer scientists and operations researchers under different names. These include "scheduling typed task systems," "multi-purpose machine scheduling," "scheduling with eligibility constraints," "scheduling...