Flow graph with non zero lower bound or 0 capacity
Your problem is NP-hard.  In the special case where no job requires any particular features, and all printers have the same availability, this becomes just the bin packing problem, which is (strongly) NP-complete.
You could try adapting standard algorithms for bin packing to your situation.  For instance, one approach would be to use integer linear programming and hope the ILP solver can handle the resulting problem instance.