New algorithms and complexity status of the reducibility problem of sequences in open shop scheduling minimizing the makespan

Michael Andresen, Tanka Nath Dhamala. New algorithms and complexity status of the reducibility problem of sequences in open shop scheduling minimizing the makespan. Annals OR, 196(1):1-26, 2012. [doi]

Abstract

Abstract is missing.