 | 2012 |
|---|
| 13 |       | Svetlana A. Kravchenko,
Frank Werner:
Minimizing total tardiness on parallel machines with preemptions.
J. Scheduling 15(2): 193-200 (2012) |
| 2011 |
|---|
| 12 | | Svetlana A. Kravchenko,
Frank Werner:
Parallel machine problems with equal processing times: a survey.
J. Scheduling 14(5): 435-444 (2011) |
| 2009 |
|---|
| 11 | | Svetlana A. Kravchenko,
Frank Werner:
Preemptive scheduling on uniform machines to minimize mean flow time.
Computers & OR 36(10): 2816-2821 (2009) |
| 10 | | Svetlana A. Kravchenko,
Frank Werner:
On a parallel machine scheduling problem with equal processing times.
Discrete Applied Mathematics 157(4): 848-852 (2009) |
| 9 | | Svetlana A. Kravchenko,
Frank Werner:
Minimizing the number of machines for scheduling jobs with equal processing times.
European Journal of Operational Research 199(2): 595-600 (2009) |
| 2008 |
|---|
| 8 | | Peter Brucker,
Svetlana A. Kravchenko:
Scheduling jobs with equal processing times and time windows on identical parallel machines.
J. Scheduling 11(4): 229-237 (2008) |
| 2007 |
|---|
| 7 | | Philippe Baptiste,
Peter Brucker,
Marek Chrobak,
Christoph Dürr,
Svetlana A. Kravchenko,
Francis Sourd:
The complexity of mean flow time scheduling problems with release times.
J. Scheduling 10(2): 139-146 (2007) |
| 2006 |
|---|
| 6 | | Philippe Baptiste,
Peter Brucker,
Marek Chrobak,
Christoph Dürr,
Svetlana A. Kravchenko,
Francis Sourd:
The Complexity of Mean Flow Time Scheduling Problems with Release Times
CoRR abs/cs/0605078: (2006) |
| 5 | | Peter Brucker,
Svetlana A. Kravchenko:
Scheduling Equal Processing Time Jobs to Minimize the Weighted Number of Late Jobs.
J. Math. Model. Algorithms 5(2): 143-165 (2006) |
| 2005 |
|---|
| 4 | | Peter Brucker,
Svetlana A. Kravchenko:
Polynomial Algorithm for Parallel Machine Mean Flow Time Scheduling Problem with Release Dates.
ICCSA (4) 2005: 182-191 |
| 2001 |
|---|
| 3 | | Svetlana A. Kravchenko,
Frank Werner:
A heuristic algorithm for minimizing mean flow time with unit setups.
Inf. Process. Lett. 79(6): 291-296 (2001) |
| 2000 |
|---|
| 2 | | Svetlana A. Kravchenko:
On the complexity of minimizing the number of late jobs in unit time open shop.
Discrete Applied Mathematics 100(1-2): 127-132 (2000) |
| 1 | | Svetlana A. Kravchenko:
Minimizing the Number of Late Jobs for the Two-machine Unit-time Job-shop Scheduling Problem.
Discrete Applied Mathematics 98(3): 209-217 (2000) |
Data released under the ODC-BY 1.0 license — See also our legal information page