A stand-alone branch-and-price algorithm for identical parallel machine scheduling with conflicts

•A branch-and-price algorithm for scheduling problems aiming to minimize the makespan.•The branch-and-price algorithm is competitive with state-of-the-art exact methods.•Competiveness is mainly achieved thanks to the proposed branching rules. We consider a scheduling problem where a set of n jobs ha...

Ausführliche Beschreibung