Svetlana A. Kravchenko

Publication Activity (10 Years)

Years Active: 1996-2021
Publications (10 Years): 2

Top Topics

Scheduling Jobs

Parallel Machines

Top Venues

Inf. Process. Lett.

Comput. Oper. Res.

Comput. Ind. Eng.

Publications

T. C. E. Cheng, Svetlana A. Kravchenko, Bertrand M. T. Lin
Complexity of server scheduling on parallel dedicated machines subject to fixed job sequences. J. Oper. Res. Soc. 72 (10) (2021)
T. C. E. Cheng, Svetlana A. Kravchenko, Bertrand M. T. Lin
Scheduling step-deteriorating jobs to minimize the total completion time. Comput. Ind. Eng. 144 (2020)
Keramat Hasani, Svetlana A. Kravchenko, Frank Werner
Minimizing total weighted completion time approximately for the parallel machine problem with a single server. Inf. Process. Lett. 114 (9) (2014)
Keramat Hasani, Svetlana A. Kravchenko, Frank Werner
Block models for scheduling jobs on two parallel machines with a single server. Comput. Oper. Res. 41 (2014)
Svetlana A. Kravchenko, Frank Werner
Erratum to: Minimizing total tardiness on parallel machines with preemptions. J. Sched. 16 (4) (2013)
Svetlana A. Kravchenko, Frank Werner
Minimizing total tardiness on parallel machines with preemptions. J. Sched. 15 (2) (2012)
Svetlana A. Kravchenko, Frank Werner
Parallel machine problems with equal processing times: a survey. J. Sched. 14 (5) (2011)
Svetlana A. Kravchenko, Frank Werner
Preemptive scheduling on uniform machines to minimize mean flow time. Comput. Oper. Res. 36 (10) (2009)
Svetlana A. Kravchenko, Frank Werner
On a parallel machine scheduling problem with equal processing times. Discret. Appl. Math. 157 (4) (2009)
Svetlana A. Kravchenko, Frank Werner
Minimizing the number of machines for scheduling jobs with equal processing times. Eur. J. Oper. Res. 199 (2) (2009)
Peter Brucker, Svetlana A. Kravchenko
Scheduling jobs with equal processing times and time windows on identical parallel machines. J. Sched. 11 (4) (2008)
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. Sched. 10 (2) (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 CoRR (2006)
Peter Brucker, Svetlana A. Kravchenko
Scheduling Equal Processing Time Jobs to Minimize the Weighted Number of Late Jobs. J. Math. Model. Algorithms 5 (2) (2006)
Peter Brucker, Svetlana A. Kravchenko
Polynomial Algorithm for Parallel Machine Mean Flow Time Scheduling Problem with Release Dates. ICCSA (4) (2005)
Svetlana A. Kravchenko, Frank Werner
A heuristic algorithm for minimizing mean flow time with unit setups. Inf. Process. Lett. 79 (6) (2001)
Svetlana A. Kravchenko
On the complexity of minimizing the number of late jobs in unit time open shop. Discret. Appl. Math. 100 (1-2) (2000)
Svetlana A. Kravchenko
Minimizing the Number of Late Jobs for the Two-machine Unit-time Job-shop Scheduling Problem. Discret. Appl. Math. 98 (3) (2000)
Peter Brucker, Svetlana A. Kravchenko, Yuri N. Sotskov
Preemptive job-shop scheduling problems with a fixed number of jobs. Math. Methods Oper. Res. 49 (1) (1999)
Irene N. Lushchakova, Svetlana A. Kravchenko
Two-machine shop scheduling with zero and unit processing times. Eur. J. Oper. Res. 107 (2) (1998)
Svetlana A. Kravchenko
A polynomial algorithm for a two-machine no-wait job-shop scheduling problem. Eur. J. Oper. Res. 106 (1) (1998)
Svetlana A. Kravchenko, Yuri N. Sotskov
Optimal makespan schedule for three jobs on two machines. Math. Methods Oper. Res. 43 (2) (1996)