Add to ORKG© 2015, Pleiades Publishing, Ltd. In this paper we proved the new properties optimal schedules for unknown strongly NP-complete scheduling problem of minimizing maximum lateness on a single machine, not allowing preemption. Pseudopolynomial implementation of the general scheme for solving that problem based on these properties is developed
We consider the scheduling problem of minimizing the makespan on a single machine with step-improvin...
It is well known that for preemptive scheduling on uniform machines there exist polynomial time exac...
Single-machine scheduling where jobs have a penalty for being late or for being rejected altogether ...
© 2015, Pleiades Publishing, Ltd. In this paper we proved the new properties optimal schedules for u...
The well-known strong NP-hard machine scheduling problem, i.e., minimization of the maximal tardines...
Abstract: We consider the problem of scheduling jobs with given release times and due dates on a sin...
We study a scheduling problem in which jobs with release times and due dates are to be processed on ...
The strongly NP-hard scheduling problem of minimizing the maximum lateness on one machine subject to...
Motivated by the conjecture that an interaction between scheduling and pre-scheduling phases in prod...
[[abstract]]This paper considers a single-machine scheduling problem to minimize the maximum latenes...
We consider the problem of scheduling jobs on a single machine subject to given release dates and pr...
We study the problem of scheduling unit execution time (UET) jobs with release dates and precedence ...
AbstractThis paper is concerned with the problem of scheduling preemptive tasks subject to precedenc...
When considering the NP-hard problem of scheduling precedence constrained tasks with preemptions on ...
The standard one-machine scheduling problem consists in schedulinga set of jobs in one machine whi...
We consider the scheduling problem of minimizing the makespan on a single machine with step-improvin...
It is well known that for preemptive scheduling on uniform machines there exist polynomial time exac...
Single-machine scheduling where jobs have a penalty for being late or for being rejected altogether ...
© 2015, Pleiades Publishing, Ltd. In this paper we proved the new properties optimal schedules for u...
The well-known strong NP-hard machine scheduling problem, i.e., minimization of the maximal tardines...
Abstract: We consider the problem of scheduling jobs with given release times and due dates on a sin...
We study a scheduling problem in which jobs with release times and due dates are to be processed on ...
The strongly NP-hard scheduling problem of minimizing the maximum lateness on one machine subject to...
Motivated by the conjecture that an interaction between scheduling and pre-scheduling phases in prod...
[[abstract]]This paper considers a single-machine scheduling problem to minimize the maximum latenes...
We consider the problem of scheduling jobs on a single machine subject to given release dates and pr...
We study the problem of scheduling unit execution time (UET) jobs with release dates and precedence ...
AbstractThis paper is concerned with the problem of scheduling preemptive tasks subject to precedenc...
When considering the NP-hard problem of scheduling precedence constrained tasks with preemptions on ...
The standard one-machine scheduling problem consists in schedulinga set of jobs in one machine whi...
We consider the scheduling problem of minimizing the makespan on a single machine with step-improvin...
It is well known that for preemptive scheduling on uniform machines there exist polynomial time exac...
Single-machine scheduling where jobs have a penalty for being late or for being rejected altogether ...