• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site

Book chapter

On Single Machine Scheduling and Knapsack Problems With Opposite Optimization Criteria

Lazarev A. A., Gafarov E., Werner F.

We consider single machine problems with opposite criteria, namely we consider the maximization of total tardiness, the maximization of the number of tardy jobs and the maximization of total completion time (in contrast to usual minimization problems) and a minimization version of the Knapsack problem.