On the exact solution of a large class of parallel machine scheduling problems

Teobaldo Bulhoes (1) , Ruslan Sadykov (2) , Anand Subramanian (1) , Eduardo Uchoa (3)

1 UFPB - Universidade Federal da Paraiba / Federal University of Paraiba
2 Realopt - Reformulations based algorithms for Combinatorial Optimization
3 UFF - Universidade Federal Fluminense [Rio de Janeiro]

This work deals with a very generic class of scheduling problems with identical/uniform/unrelated parallel machine environment. It considers well-known attributes such as release dates or sequence-dependent setup times and accepts any objective function defined over job completion times. Non-regular objectives are also supported. We introduce a branch-cut-and-price algorithm for such problems that makes use of non-robust cuts, i.e., cuts which change the structure of the pricing problem. This is the first time that such cuts are employed for machine scheduling problems. The algorithm also embeds other important techniques such as strong branching, reduced cost fixing and dual stabilization. Computational experiments over literature benchmarks showed that the proposed algorithm is indeed effective and could solve many instances to optimality for the first time.

Mots clés: Parallel machines; Unified algorithm; Branch-cut-and-price

Domaines: Recherche opérationnelle [math.OC]

Teobaldo Bulhoes, Ruslan Sadykov, Anand Subramanian, Eduardo Uchoa. On the exact solution of a large class of parallel machine scheduling problems. Journal of Scheduling, 2020, 23, pp.411-429. ⟨10.1007/s10951-020-00640-z⟩. ⟨hal-01958180⟩