Hardness of lazy packing and covering

We prove APX-hardness for the two problems maximum resource bin packing and lazy bin covering. Simple algorithms matching the best absolute bounds under the assumption P≠NPP≠NP are also derived.