A Reformulation for the Problem of Scheduling Unrelated Parallel Machines with Sequence and Machine Dependent Setup Times

@inproceedings{AvalosRosales2013ARF,
  title={A Reformulation for the Problem of Scheduling Unrelated Parallel Machines with Sequence and Machine Dependent Setup Times},
  author={Oliver Avalos-Rosales and Ada M. Alvarez and Francisco {\'A}ngel-Bello},
  booktitle={ICAPS},
  year={2013}
}
In this paper we propose an improved formulation for an unrelated parallel machine problem with machine and job sequence-dependent setup times that outperforms the previously published formulations regarding size of instances and CPU time to reach optimal solutions. The main difference between the proposed formulation and previous ones is the way the makespan has been linearized. It provides improved dual bounds which speeds up the solution process when using a branch-and-bound commercial… CONTINUE READING