1 problem

0 votes0 replies0 views
The factor-2 conjecture for weight-order scheduling with non-renewable resources
Consider the single-machine scheduling problem $1|nr=1,p_j=1,w_j=a_j|\sum w_jC_j$ , where each job $j$ has unit processing time, weight $w_j$ , and non-renewable resource requirement…
Conjectureopenapproximation-algorithms resource-constrained-scheduling schedulingarXiv posted 2 days ago

The factor-2 conjecture for weight-order scheduling with non-renewable resources