Preemptive Scheduling with Job-Dependent Setup Times

@inproceedings{Schuurman1999PreemptiveSW,
  title={Preemptive Scheduling with Job-Dependent Setup Times},
  author={Petra Schuurman and Gerhard J. Woeginger},
  booktitle={SODA},
  year={1999}
}
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. This problem obviously is NP-complete. In this paper we discuss polynomial time approximation algorithms for this problem. For the general… CONTINUE READING