Svetlana A. Kravchenko

According to our database, Svetlana A. Kravchenko authored at least 22 papers between 1996 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

On scheduling of step-improving jobs to minimize the total weighted completion time.

T. C. E. Cheng, Svetlana A. Kravchenko, Bertrand M. T. Lin

J. Oper. Res. Soc., April, 2024

2021

Complexity of server scheduling on parallel dedicated machines subject to fixed job sequences.

T. C. E. Cheng, Svetlana A. Kravchenko, Bertrand M. T. Lin

J. Oper. Res. Soc., 2021

2020

Scheduling step-deteriorating jobs to minimize the total completion time.

T. C. E. Cheng, Svetlana A. Kravchenko, Bertrand M. T. Lin

Comput. Ind. Eng., 2020

2014

Minimizing total weighted completion time approximately for the parallel machine problem with a single server.

Keramat Hasani, Svetlana A. Kravchenko, Frank Werner

Inf. Process. Lett., 2014

Block models for scheduling jobs on two parallel machines with a single server.

Keramat Hasani, Svetlana A. Kravchenko, Frank Werner

Comput. Oper. Res., 2014

2013

Erratum to: Minimizing total tardiness on parallel machines with preemptions.

Svetlana A. Kravchenko, Frank Werner

J. Sched., 2013

2012

Minimizing total tardiness on parallel machines with preemptions.

Svetlana A. Kravchenko, Frank Werner

J. Sched., 2012

2011

Parallel machine problems with equal processing times: a survey.

Svetlana A. Kravchenko, Frank Werner

J. Sched., 2011

2009

Minimizing the number of machines for scheduling jobs with equal processing times.

Svetlana A. Kravchenko, Frank Werner

Eur. J. Oper. Res., 2009

On a parallel machine scheduling problem with equal processing times.

Svetlana A. Kravchenko, Frank Werner

Discret. Appl. Math., 2009

Preemptive scheduling on uniform machines to minimize mean flow time.

Svetlana A. Kravchenko, Frank Werner

Comput. Oper. Res., 2009

2008

Scheduling jobs with equal processing times and time windows on identical parallel machines.

Peter Brucker, Svetlana A. Kravchenko

J. Sched., 2008

2007

The complexity of mean flow time scheduling problems with release times.

Philippe Baptiste, Peter Brucker, Marek Chrobak, Christoph Dürr, Svetlana A. Kravchenko, Francis Sourd

J. Sched., 2007

2006

Scheduling Equal Processing Time Jobs to Minimize the Weighted Number of Late Jobs.

Peter Brucker, Svetlana A. Kravchenko

J. Math. Model. Algorithms, 2006

2005

Polynomial Algorithm for Parallel Machine Mean Flow Time Scheduling Problem with Release Dates.

Peter Brucker, Svetlana A. Kravchenko

Proceedings of the Computational Science and Its Applications, 2005

2001

A heuristic algorithm for minimizing mean flow time with unit setups.

Svetlana A. Kravchenko, Frank Werner

Inf. Process. Lett., 2001

2000

Minimizing the Number of Late Jobs for the Two-machine Unit-time Job-shop Scheduling Problem.

Svetlana A. Kravchenko

Discret. Appl. Math., 2000

On the complexity of minimizing the number of late jobs in unit time open shop.

Svetlana A. Kravchenko

Discret. Appl. Math., 2000

1999

Preemptive job-shop scheduling problems with a fixed number of jobs.

Peter Brucker, Svetlana A. Kravchenko, Yuri N. Sotskov

Math. Methods Oper. Res., 1999

1998

Two-machine shop scheduling with zero and unit processing times.

Irene N. Lushchakova, Svetlana A. Kravchenko

Eur. J. Oper. Res., 1998

A polynomial algorithm for a two-machine no-wait job-shop scheduling problem.

Svetlana A. Kravchenko

Eur. J. Oper. Res., 1998

1996

Optimal makespan schedule for three jobs on two machines.

Svetlana A. Kravchenko, Yuri N. Sotskov

Math. Methods Oper. Res., 1996