Svetlana A. Kravchenko

23 papers Journal 22Unranked 1
YearRankTypeTitle / Venue / Authors
2024 J jnl
On scheduling of step-improving jobs to minimize the total weighted completion time.
J. Oper. Res. Soc.
T. C. E. Cheng, Svetlana A. Kravchenko, Bertrand M. T. Lin
2021 J jnl
Complexity of server scheduling on parallel dedicated machines subject to fixed job sequences.
J. Oper. Res. Soc.
T. C. E. Cheng, Svetlana A. Kravchenko, Bertrand M. T. Lin
2020 J jnl
Scheduling step-deteriorating jobs to minimize the total completion time.
Comput. Ind. Eng.
T. C. E. Cheng, Svetlana A. Kravchenko, Bertrand M. T. Lin
2014 J jnl
Block models for scheduling jobs on two parallel machines with a single server.
Comput. Oper. Res.
Keramat Hasani, Svetlana A. Kravchenko, Frank Werner
2014 J jnl
Minimizing total weighted completion time approximately for the parallel machine problem with a single server.
Inf. Process. Lett.
Keramat Hasani, Svetlana A. Kravchenko, Frank Werner
2013 J jnl
Erratum to: Minimizing total tardiness on parallel machines with preemptions.
J. Sched.
Svetlana A. Kravchenko, Frank Werner
2012 J jnl
Minimizing total tardiness on parallel machines with preemptions.
J. Sched.
Svetlana A. Kravchenko, Frank Werner
2011 J jnl
Parallel machine problems with equal processing times: a survey.
J. Sched.
Svetlana A. Kravchenko, Frank Werner
2009 J jnl
Minimizing the number of machines for scheduling jobs with equal processing times.
Eur. J. Oper. Res.
Svetlana A. Kravchenko, Frank Werner
2009 J jnl
On a parallel machine scheduling problem with equal processing times.
Discret. Appl. Math.
Svetlana A. Kravchenko, Frank Werner
2009 J jnl
Preemptive scheduling on uniform machines to minimize mean flow time.
Comput. Oper. Res.
Svetlana A. Kravchenko, Frank Werner
2008 J jnl
Scheduling jobs with equal processing times and time windows on identical parallel machines.
J. Sched.
Peter Brucker, Svetlana A. Kravchenko
2007 J jnl
The complexity of mean flow time scheduling problems with release times.
J. Sched.
Philippe Baptiste, Peter Brucker, Marek Chrobak, Christoph Dürr, Svetlana A. Kravchenko, Francis Sourd
2006 J jnl
Scheduling Equal Processing Time Jobs to Minimize the Weighted Number of Late Jobs.
J. Math. Model. Algorithms
Peter Brucker, Svetlana A. Kravchenko
2006 J jnl
The Complexity of Mean Flow Time Scheduling Problems with Release Times
CoRR
Philippe Baptiste, Peter Brucker, Marek Chrobak, Christoph Dürr, Svetlana A. Kravchenko, Francis Sourd
2005 — conf
Polynomial Algorithm for Parallel Machine Mean Flow Time Scheduling Problem with Release Dates.
ICCSA (4)
Peter Brucker, Svetlana A. Kravchenko
2001 J jnl
A heuristic algorithm for minimizing mean flow time with unit setups.
Inf. Process. Lett.
Svetlana A. Kravchenko, Frank Werner
2000 J jnl
Minimizing the Number of Late Jobs for the Two-machine Unit-time Job-shop Scheduling Problem.
Discret. Appl. Math.
Svetlana A. Kravchenko
2000 J jnl
On the complexity of minimizing the number of late jobs in unit time open shop.
Discret. Appl. Math.
Svetlana A. Kravchenko
1999 J jnl
Preemptive job-shop scheduling problems with a fixed number of jobs.
Math. Methods Oper. Res.
Peter Brucker, Svetlana A. Kravchenko, Yuri N. Sotskov
1998 J jnl
A polynomial algorithm for a two-machine no-wait job-shop scheduling problem.
Eur. J. Oper. Res.
Svetlana A. Kravchenko
1998 J jnl
Two-machine shop scheduling with zero and unit processing times.
Eur. J. Oper. Res.
Irene N. Lushchakova, Svetlana A. Kravchenko
1996 J jnl
Optimal makespan schedule for three jobs on two machines.
Math. Methods Oper. Res.
Svetlana A. Kravchenko, Yuri N. Sotskov