Preemptive Scheduling with Job-Dependent Setup Times


We investigate the problem of preemptively scheduling n jobs on m parallel machines. Whenever a machine switches from the processing of one job Jk to the processing of some other job Jj, a setup time sj is necessary; this setup time sj only depends on the job Jj which is next to be processed. The objective is to find a schedule that minimizes the makespan… (More)