BULHOES, Teobaldo; SADYKOV, Ruslan; SUBRAMANIAN, Anand; UCHOA, Eduardo

doi:10.1007/s10951-020-00640-z

Metadatos

Mostrar el registro completo del ítem

Licencia de uso del documento

BULHOES, Teobaldo
Universidade Federal da Paraiba / Federal University of Paraiba [UFPB]

SADYKOV, Ruslan
Reformulations based algorithms for Combinatorial Optimization [Realopt]

SUBRAMANIAN, Anand
Universidade Federal da Paraiba / Federal University of Paraiba [UFPB]

Idioma

Article de revue

Este ítem está publicado en

Journal of Scheduling. 2020, vol. 23, p. 411-429

Springer Verlag

Resumen en inglés

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.< Leer menos

Palabras clave en inglés

Parallel machines

Unified algorithm

Branch-cut-and-price

Metadatos

Compartir este ítem

Licencia de uso del documento

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

Idioma

Este ítem está publicado en

Resumen en inglés

Palabras clave en inglés

URI

DOI

Orígen

Centros de investigación