Add to ORKGThe well-known strong NP-hard machine scheduling problem, i.e., minimization of the maximal tardiness, is investigated. New properties of the optimal schedule are derived and used to develop a new scheme for solving the above problem
The paper deals with the single machine scheduling problem where both total and maximum tardiness mu...
We survey and extend the results on the complexity of machine scheduling problems. After a brief rev...
The investigation is concerned with the generalized tasks of the scheduling theory. The aim of the i...
The well-known strong NP-hard machine scheduling problem, i.e., minimization of the maximal tardines...
© 2015, Pleiades Publishing, Ltd. In this paper we proved the new properties optimal schedules for u...
The strongly NP-hard scheduling problem of minimizing the maximum lateness on one machine subject to...
The scheduling problem of minimizing total tardiness on a single machine is known to be NP-hard in t...
We consider the NP-hard problem of scheduling jobs on identical parallel machines to minimize total ...
Abstract. We study the classical NP-hard in the ordinary sense single-machine total tardiness schedu...
Methods of solving the problem of the schedule problem are examined, the advantages and disadvantage...
The aim in this thesis is to develop efficient enumeration algorithms to solve certain strongly NP-h...
This dissertation addresses the problem of scheduling a set of jobs under two different measures of ...
In this paper the one-machine scheduling problem with the objective of minimizing the mean tardiness...
In this paper the one-machine scheduling problem with the objective of minimizing the mean tardiness...
Editeur en chef : Peter Hammer. Article dans revue scientifique avec comité de lecture. internationa...
The paper deals with the single machine scheduling problem where both total and maximum tardiness mu...
We survey and extend the results on the complexity of machine scheduling problems. After a brief rev...
The investigation is concerned with the generalized tasks of the scheduling theory. The aim of the i...
The well-known strong NP-hard machine scheduling problem, i.e., minimization of the maximal tardines...
© 2015, Pleiades Publishing, Ltd. In this paper we proved the new properties optimal schedules for u...
The strongly NP-hard scheduling problem of minimizing the maximum lateness on one machine subject to...
The scheduling problem of minimizing total tardiness on a single machine is known to be NP-hard in t...
We consider the NP-hard problem of scheduling jobs on identical parallel machines to minimize total ...
Abstract. We study the classical NP-hard in the ordinary sense single-machine total tardiness schedu...
Methods of solving the problem of the schedule problem are examined, the advantages and disadvantage...
The aim in this thesis is to develop efficient enumeration algorithms to solve certain strongly NP-h...
This dissertation addresses the problem of scheduling a set of jobs under two different measures of ...
In this paper the one-machine scheduling problem with the objective of minimizing the mean tardiness...
In this paper the one-machine scheduling problem with the objective of minimizing the mean tardiness...
Editeur en chef : Peter Hammer. Article dans revue scientifique avec comité de lecture. internationa...
The paper deals with the single machine scheduling problem where both total and maximum tardiness mu...
We survey and extend the results on the complexity of machine scheduling problems. After a brief rev...
The investigation is concerned with the generalized tasks of the scheduling theory. The aim of the i...