Single-Machine Scheduling Problems with Past-Sequence-Dependent Setup Times and Deterioration Jobs

Abstract

This paper considers a single-machine scheduling model with past-sequence-dependent setup times and deterioration jobs, where the actual processing time of a job is a function of the job’s scheduled position. It shows that the optimal schedules for the single-machine scheduling problems to minimize makespan and total completion time are both V-shaped with respect to job processing times.