New characterizations for the identical coupled tasks scheduling problem

Abstract

In this note we introduce new characterizations for the optimal solution of the identical coupled tasks scheduling problem. We also develop three lower bounds and formulate useful observations about the choice of the test instances.