Svetlana A. Kravchenko

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
On scheduling of step-improving jobs to minimize the total weighted completion time.
J. Oper. Res. Soc., April, 2024

2021
Complexity of server scheduling on parallel dedicated machines subject to fixed job sequences.
J. Oper. Res. Soc., 2021

2020
Scheduling step-deteriorating jobs to minimize the total completion time.
Comput. Ind. Eng., 2020

2014
Minimizing total weighted completion time approximately for the parallel machine problem with a single server.
Inf. Process. Lett., 2014

Block models for scheduling jobs on two parallel machines with a single server.
Comput. Oper. Res., 2014

2013
Erratum to: Minimizing total tardiness on parallel machines with preemptions.
J. Sched., 2013

2012
Minimizing total tardiness on parallel machines with preemptions.
J. Sched., 2012

2011
Parallel machine problems with equal processing times: a survey.
J. Sched., 2011

2009
Minimizing the number of machines for scheduling jobs with equal processing times.
Eur. J. Oper. Res., 2009

On a parallel machine scheduling problem with equal processing times.
Discret. Appl. Math., 2009

Preemptive scheduling on uniform machines to minimize mean flow time.
Comput. Oper. Res., 2009

2008
Scheduling jobs with equal processing times and time windows on identical parallel machines.
J. Sched., 2008

2007
The complexity of mean flow time scheduling problems with release times.
J. Sched., 2007

2006
Scheduling Equal Processing Time Jobs to Minimize the Weighted Number of Late Jobs.
J. Math. Model. Algorithms, 2006

2005
Polynomial Algorithm for Parallel Machine Mean Flow Time Scheduling Problem with Release Dates.
Proceedings of the Computational Science and Its Applications, 2005

2001
A heuristic algorithm for minimizing mean flow time with unit setups.
Inf. Process. Lett., 2001

2000
Minimizing the Number of Late Jobs for the Two-machine Unit-time Job-shop Scheduling Problem.
Discret. Appl. Math., 2000

On the complexity of minimizing the number of late jobs in unit time open shop.
Discret. Appl. Math., 2000

1999
Preemptive job-shop scheduling problems with a fixed number of jobs.
Math. Methods Oper. Res., 1999

1998
Two-machine shop scheduling with zero and unit processing times.
Eur. J. Oper. Res., 1998

A polynomial algorithm for a two-machine no-wait job-shop scheduling problem.
Eur. J. Oper. Res., 1998

1996
Optimal makespan schedule for three jobs on two machines.
Math. Methods Oper. Res., 1996


  Loading...