Scheduling on parallel identical machines to minimize total tardiness

@article{Shim2007SchedulingOP,
  title={Scheduling on parallel identical machines to minimize total tardiness},
  author={Sang-Oh Shim and Yeong-Dae Kim},
  journal={European Journal of Operational Research},
  year={2007},
  volume={177},
  pages={135-146}
}
This paper focuses on the problem of scheduling n independent jobs on m identical parallel machines for the objective of minimizing total tardiness of the jobs. We develop dominance properties and lower bounds, and develop a branch and bound algorithm using these properties and lower bounds as well as upper bounds obtained from a heuristic algorithm. Computational experiments are performed on randomly generated test problems and results show that the algorithm solves problems with moderate… CONTINUE READING