Optimal makespan schedule for three jobs on two machines. - Svetlana A. Kravchenko; Yuri N. Sotskov (Math. Methods Oper. Res., 1996)

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

Two-machine shop scheduling with zero and unit processing times. - Irene N. Lushchakova; Svetlana A. Kravchenko (Eur. J. Oper. Res., 1998)

Preemptive job-shop scheduling problems with a fixed number of jobs. - Peter Brucker; Svetlana A. Kravchenko; Yuri N. Sotskov (Math. Methods Oper. Res., 1999)

On the complexity of minimizing the number of late jobs in unit time open shop. - Svetlana A. Kravchenko (Discret. Appl. Math., 2000)

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

A heuristic algorithm for minimizing mean flow time with unit setups. - Svetlana A. Kravchenko; Frank Werner 001 (Inf. Process. Lett., 2001)

Polynomial Algorithm for Parallel Machine Mean Flow Time Scheduling Problem with Release Dates. - Peter Brucker; Svetlana A. Kravchenko (ICCSA (4), 2005)

Scheduling Equal Processing Time Jobs to Minimize the Weighted Number of Late Jobs. - Peter Brucker; Svetlana A. Kravchenko (J. Math. Model. Algorithms, 2006)

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)

Scheduling jobs with equal processing times and time windows on identical parallel machines. - Peter Brucker; Svetlana A. Kravchenko (J. Sched., 2008)

Preemptive scheduling on uniform machines to minimize mean flow time. - Svetlana A. Kravchenko; Frank Werner 001 (Comput. Oper. Res., 2009)

On a parallel machine scheduling problem with equal processing times. - Svetlana A. Kravchenko; Frank Werner 001 (Discret. Appl. Math., 2009)

Minimizing the number of machines for scheduling jobs with equal processing times. - Svetlana A. Kravchenko; Frank Werner 001 (Eur. J. Oper. Res., 2009)

Parallel machine problems with equal processing times: a survey. - Svetlana A. Kravchenko; Frank Werner 001 (J. Sched., 2011)

Minimizing total tardiness on parallel machines with preemptions. - Svetlana A. Kravchenko; Frank Werner 001 (J. Sched., 2012)

Erratum to: Minimizing total tardiness on parallel machines with preemptions. - Svetlana A. Kravchenko; Frank Werner 001 (J. Sched., 2013)

Block models for scheduling jobs on two parallel machines with a single server. - Keramat Hasani; Svetlana A. Kravchenko; Frank Werner 001 (Comput. Oper. Res., 2014)

Minimizing total weighted completion time approximately for the parallel machine problem with a single server. - Keramat Hasani; Svetlana A. Kravchenko; Frank Werner 001 (Inf. Process. Lett., 2014)

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)

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)

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., 2024)