Svetlana A. Kravchenko

From MaRDI portal
Revision as of 10:01, 11 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Svetlana A. Kravchenko to Svetlana A. Kravchenko: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:336765

Available identifiers

zbMath Open kravchenko.svetlana-aMaRDI QIDQ336765

List of research outcomes





PublicationDate of PublicationType
Server scheduling on parallel dedicated machines with fixed job sequences2019-08-12Paper
Preemptive parallel‐machine scheduling with a common server to minimize makespan2019-05-02Paper
Block models for scheduling jobs on two parallel machines with a single server2016-11-10Paper
Erratum to: ``Minimizing total tardiness on parallel machines with preemptions2014-08-18Paper
Minimizing total weighted completion time approximately for the parallel machine problem with a single server2014-05-05Paper
Parallel machine problems with equal processing times: a survey2014-02-05Paper
Minimizing total tardiness on parallel machines with preemptions2014-02-05Paper
Scheduling with multiple servers2011-01-03Paper
Parallel machine scheduling problems with a single server2010-05-06Paper
Minimizing the number of machines for scheduling jobs with equal processing times2009-12-07Paper
Scheduling jobs with equal processing times and time windows on identical parallel machines2009-08-28Paper
On a parallel machine scheduling problem with equal processing times2009-06-30Paper
Preemptive scheduling on uniform machines to minimize mean flow time2009-05-19Paper
The complexity of mean flow time scheduling problems with release times2007-05-15Paper
Scheduling equal processing time jobs to minimize the weighted number of late jobs2006-11-17Paper
Complexity results for parallel machine problems with a single server2003-02-23Paper
A heuristic algorithm for minimizing mean flow time with unit setups2002-07-14Paper
On the complexity of minimizing the number of late jobs in unit time open shop2000-01-30Paper
Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem2000-01-30Paper
Preemptive job-shop scheduling problems with a fixed number of jobs1999-09-07Paper
Two-machine shop scheduling with zero and unit processing times1999-07-11Paper
https://portal.mardi4nfdi.de/entity/Q42465251999-06-01Paper
On the complexity of two machine job-shop scheduling with regular objective functions1997-12-04Paper
https://portal.mardi4nfdi.de/entity/Q48829971996-07-01Paper
https://portal.mardi4nfdi.de/entity/Q48410081995-09-27Paper
https://portal.mardi4nfdi.de/entity/Q48410131995-09-27Paper
Optimal schedules with infinitely large stability radius1995-06-21Paper
https://portal.mardi4nfdi.de/entity/Q30305101983-01-01Paper

Research outcomes over time

This page was built for person: Svetlana A. Kravchenko