Место издания:Otto-von-Guericke Universitaet Magdeburg, Germany
Объём:
29 страниц
Аннотация:We consider single machine problems with opposite criteria,namely we consider the maximization of total tardiness, themaximization of the number of tardy jobs and the maximization oftotal completion time (in contrast to usual minimization problems)and a minimization version of the Knapsack problem.