Algorithms for some maximization scheduling problems on a single machine

What is it about?

Two scheduling problems on a single machine are considered, where a specific objective function has to be maximized. Exact algorithms for the single machine problem of maximizing total tardiness and for the problem of maximizing the number of tardy jobs are given. For both problems, it is assumed that the processing of the first job starts at time zero and there is no idle time between the jobs.

Featured Image