Energy-aware scheduling of jobs performed sequentially

We consider a problem of energy allocation to computational jobs performed on one machine, where jobs may be performed with different speeds. An energy amount is related to a particular speed of a job, and this relation is nonlinear. The objective is to find a minimum energy allocation which guarantees that the last job in the sequence is finished before a deadline. A model of job processing, a general approach, and a heuristic algorithm are proposed in the paper.