AbstractWe consider single-machine scheduling with a non-renewable resource. In this setting, we are given a set of jobs, each characterized by a processing time, a weight, and a resource requirement. At fixed points in time, certain amounts of the resource are made available to be consumed by the jobs. The goal is to assign the jobs non-preemptively to time slots on the machine, so that each job has enough resource available at the start of its processing. The objective that we consider is the minimization of the sum of weighted completion times. The main contribution of the paper is a PTAS for the case of 0 processing times ($$1|rm=1,p_j=0|\sum w_jC_j$$ 1 | r m = 1 , p j = 0 | ∑ w j C j ). In addition, we show strong NP-hardness of the case of unit resource requirements and weights ($$1|rm=1,a_j=1|\sum C_j$$ 1 | r m = 1 , a j = 1 | ∑ C j ), thus answering an open question of Györgyi and Kis. We also prove that the schedule corresponding to the Shortest Processing Time First ordering provides a 3/2-approximation for the latter problem. Finally, we investigate a variant of the problem where processing times are 0 and the resource arrival times are unknown. We present a $$(4+\epsilon )$$ ( 4 + ϵ ) -approximation algorithm, together with a $$(4-\varepsilon )$$ ( 4 - ε ) -inapproximability result, for any $$\varepsilon >0$$ ε > 0 .