Kravchenko Svetlana A.

Svetlana A. Kravchenko

Information about the author Svetlana A. Kravchenko will soon be added to the site.
Found 6 papers in total
The complexity of mean flow time scheduling problems with release times
The complexity of mean flow time scheduling problems with release times
2007
We study the problem of preemptive scheduling of n jobs with given release times on m...
Scheduling equal processing time jobs to minimize the weighted number of late jobs
Scheduling equal processing time jobs to minimize the weighted number of late jobs
2006
We prove that the problem {P|p i =p (all i), pmtn | ∑ i w i U i } is...
Complexity results for parallel machine problems with a single server
Complexity results for parallel machine problems with a single server
2002
Parallel machine problems with a single server are generalizations of classical...
On the complexity of minimizing the number of late jobs in unit time open shop
On the complexity of minimizing the number of late jobs in unit time open shop
2000
The complexity status of unit time open shop with release dates and the minimal number...
A polynomial algorithm for a two-machine no-wait job-shop scheduling problem
A polynomial algorithm for a two-machine no-wait job-shop scheduling problem
1998
This paper considers the no-wait scheduling of n jobs, where each job is a chain of...
Two-machine shop scheduling with zero and unit processing times
Two-machine shop scheduling with zero and unit processing times
1998
We consider the two machine flow shop and open shop problems to minimize the weighted...
Papers per page: