“…The problem is NP-hard in the strong sense, since the task of minimizing TWT on a single machine (1jj P w j T j ) is already NP-hard in the strong sense [22]. Only a few articles have considered single machine bicriteria scheduling problems with release dates [20,[32][33][34][35]44]. Most of them developed heuristics to tackle the studied problem.…”