Scheduling on a Single Processor with Variable Speed

In this paper a single machine scheduling problem with varying processing times is considered. The scheduling objectives are makespan, total flow time, and sum of deviations of jobs completion times from a common due date. Polynomial time algorithms for optimal solutions of the problems are given.