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

Abstract : 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.
Document type :
Complete list of metadatas

Cited literature [46 references]  Display  Hide  Download

Contributor : Ruslan Sadykov <>
Submitted on : Monday, December 17, 2018 - 5:35:34 PM
Last modification on : Friday, December 28, 2018 - 1:10:04 AM


Files produced by the author(s)


  • HAL Id : hal-01958180, version 1


Teobaldo Bulhoes, Ruslan Sadykov, Anand Subramanian, Eduardo Uchoa. On the exact solution of a large class of parallel machine scheduling problems. [Research Report] Cadernos do LOGIS 2018-3, Universidade Federal Fluminense. 2018. ⟨hal-01958180⟩



Record views


Files downloads