| 2012 | Svetlana A. Kravchenko, Frank Werner: Minimizing a regular function on uniform machine with ordered completion times . In: Z.A. Mann, Linear Programming - New Frontiers in Theory and Applications. Nova Science Publishers, 2012. 159-172 |
|---|
| 2012 | Svetlana A. Kravchenko, Frank Werner: Minimizing total tardiness on parallel machines with preemptions . In: Journal of Scheduling, 2012, 193-200 |
|---|
| 2011 | Svetlana A. Kravchenko, Frank Werner
: Parallel machine problems
with equal processing times: a survey.
. In: Journal of Scheduling, 2011, 435-444 |
|---|
| 2011 | Svetlana A. Kravchenko, Frank Werner: Parallel machine problems with equal processing times: a survey. In: Journal of Scheduling, 2011, 435-444 |
|---|
| 2009 | Svetlana A. Kravchenko, Frank Werner: Minimizing the number of machines for scheduling jobs with equal processing times. In: European Journal of Operational Research, 2009, 595-600 |
|---|
| 2009 | Svetlana A. Kravchenko, Frank Werner: On a parallel machine scheduling problem with equal processing times. In: Discrete Applied Mathematics, 2009, 848-852 |
|---|
| 2009 | Svetlana A. Kravchenko, Frank Werner: Preemptive scheduling on uniform machines to minimize mean flow time. In: Computers & Operations Research, 2009, 2816-2821 |
|---|
| 2008 | Peter Brucker, Svetlana A. Kravchenko: Scheduling jobs with equal processing times and time windows on identical parallel machines. In: Journal of Scheduling, 2008, 229-237 |
|---|
| 2007 | 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. In: Journal of Scheduling, 2007, 139-146 |
|---|
| 2006 | Peter Brucker, Svetlana A. Kravchenko: Scheduling Equal Processing Time Jobs to Minimize the Weighted Number of Late Jobs. In: Journal of Mathematical Modelling and Algorithm, 2006, 143-165 |
|---|
| 2005 | Peter Brucker, Svetlana A. Kravchenko: Polynomial Algorithm for Parallel Machine Mean Flow Time Scheduling Problem with Release Dates. In: Lecture Notes in Computer Science, 2005, 182-191 |
|---|
