Single machine problem with a minimax criteria and preemption penalties

In this paper a single machine scheduling problem with release dates is addressed. All jobs must be completed before the given deadlines and the cost of criteria depends on the completion date of the job and number of preemptions. When a job is preempted, a job-dependent setup cost must take place. Based on the analysis of problem characteristics, an efficient algorithm is proposed for the problem and some numerical examples are presented.