Scheduling concurrent production over a finite planning horizon: polynomially solvable cases

Konstantin Kogan. Scheduling concurrent production over a finite planning horizon: polynomially solvable cases. Computers & OR, 27(14):1409-1419, 2000. [doi]

Abstract

Abstract is missing.