A time-dependent multiple criteria single-machine scheduling problem

We introduce a nonpreemptive single-machine scheduling model with time-dependent multiple criteria. We formulate the problem as a knapsack problem and propose a dynamic programming (DP)-based algorithm to finding all efficient schedules. An illustrative example is enclosed.