It is well known that job shop scheduling problems are notoriously hard from a computational point of view. Many papers exist for the makespan objective, and some report on min sum objectives (like minimize weighted completion time, minimize earliness/tardiness penalties etc).
My question: does anyone know whether makespan or min sum objectives are computationally more difficult when using MILP approaches?