@ARTICLE{Różycki_R._Scheduling_2020,
 author={Różycki, R. and Waligóra, G. and Węglarz, J.},
 volume={68},
 number={No. 2 (i.a. Special Section on Computational Intelligence in Communications)},
 journal={Bulletin of the Polish Academy of Sciences Technical Sciences},
 pages={299-306},
 howpublished={online},
 year={2020},
 abstract={In this work we consider a problem from the field of power- and energy-aware scheduling, in which a set of batteries have to be charged in a minimum time. The formulated problem is to schedule independent and nonpreemptable jobs to minimize the schedule length, where each job requires some amount of power and consumes a certain amount of energy during its processing. We assume that the power demand of each job linearly decreases with time, as it is the case when Li-ion batteries are being charged. For the assumed job model we prove that each next job should be started as soon as the required amount of power is available. Basing on the proven theorem we formulate a procedure generating a minimum-length schedule for an assumed order of jobs. We also analyze the case of identical jobs, and show some interesting properties of this case.},
 type={Article},
 title={Scheduling battery charging jobs with linearly decreasing power demands to minimize the total time},
 URL={http://journals.pan.pl/Content/116293/PDF/15D_299-306_01408_Bpast.No.68-2_26.04.20_K1A.pdf},
 doi={10.24425/bpasts.2020.133115},
 keywords={scheduling, makespan, power, energy, continuous resource},
}