Single machine scheduling with start time dependent processing times

This paper discusses a single machine scheduling problem with processing time depending on starting time for the queuing jobs. In this scheduling model, each job has a common processing time. There will be a time penalty for this job when the starting time falls behind a given common deadline. In this paper, the objective function is defined as the least-makespan and flow time, and polynomial algorithms are given for analyzing some special cases.