Interweaving Real-Time Jobs with Energy Harvesting to Maximize Throughput

Motivated by batteryless IoT devices, we consider the following scheduling problem. The input includes n unit time jobs, where each job has a release time, due date, energy requirement, and weight. We consider time to be slotted; hence, all time related job values refer to slots. Let. The input also includes an h(t) value for every time slot t, which is the energy harvestable on that slot. Energy is harvested at time slots when no job is executed. The objective is to find a feasible schedule that maximizes the weight of the scheduled jobs. A schedule is feasible if for every job in the schedule and its corresponding slot, if,, and the available energy before is at least. To the best of our knowledge, we are the first to consider the theoretical aspects of this problem. In this work we show the following. (1) A polynomial time algorithm when all jobs have identical and. (2) A -approximation algorithm when all jobs have identical but arbitrary and. (3) An FPTAS when all jobs have identical and but arbitrary. (4) Reductions showing that all the variants of the problem in which at least one of the attributes,, or are not identical for all jobs are.