default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSvetlana A. Kravchenko
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j21]T. C. E. Cheng, Svetlana A. Kravchenko, Bertrand M. T. Lin:
On scheduling of step-improving jobs to minimize the total weighted completion time. J. Oper. Res. Soc. 75(4): 720-730 (2024)- 2021
- [j20]T. C. E. Cheng, Svetlana A. Kravchenko, Bertrand M. T. Lin
:
Complexity of server scheduling on parallel dedicated machines subject to fixed job sequences. J. Oper. Res. Soc. 72(10): 2286-2289 (2021) - 2020
- [j19]T. C. E. Cheng, Svetlana A. Kravchenko, Bertrand M. T. Lin:
Scheduling step-deteriorating jobs to minimize the total completion time. Comput. Ind. Eng. 144: 106329 (2020)
2010 – 2019
- 2014
- [j18]Keramat Hasani, Svetlana A. Kravchenko, Frank Werner:
Block models for scheduling jobs on two parallel machines with a single server. Comput. Oper. Res. 41: 94-97 (2014) - [j17]Keramat Hasani, Svetlana A. Kravchenko, Frank Werner:
Minimizing total weighted completion time approximately for the parallel machine problem with a single server. Inf. Process. Lett. 114(9): 500-503 (2014) - 2013
- [j16]Svetlana A. Kravchenko, Frank Werner:
Erratum to: Minimizing total tardiness on parallel machines with preemptions. J. Sched. 16(4): 439-441 (2013) - 2012
- [j15]Svetlana A. Kravchenko, Frank Werner:
Minimizing total tardiness on parallel machines with preemptions. J. Sched. 15(2): 193-200 (2012) - 2011
- [j14]Svetlana A. Kravchenko, Frank Werner:
Parallel machine problems with equal processing times: a survey. J. Sched. 14(5): 435-444 (2011)
2000 – 2009
- 2009
- [j13]Svetlana A. Kravchenko, Frank Werner:
Preemptive scheduling on uniform machines to minimize mean flow time. Comput. Oper. Res. 36(10): 2816-2821 (2009) - [j12]Svetlana A. Kravchenko, Frank Werner:
On a parallel machine scheduling problem with equal processing times. Discret. Appl. Math. 157(4): 848-852 (2009) - [j11]Svetlana A. Kravchenko, Frank Werner:
Minimizing the number of machines for scheduling jobs with equal processing times. Eur. J. Oper. Res. 199(2): 595-600 (2009) - 2008
- [j10]Peter Brucker, Svetlana A. Kravchenko:
Scheduling jobs with equal processing times and time windows on identical parallel machines. J. Sched. 11(4): 229-237 (2008) - 2007
- [j9]Philippe Baptiste, Peter Brucker, Marek Chrobak, Christoph Dürr, Svetlana A. Kravchenko, Francis Sourd:
The complexity of mean flow time scheduling problems with release times. J. Sched. 10(2): 139-146 (2007) - 2006
- [j8]Peter Brucker, Svetlana A. Kravchenko:
Scheduling Equal Processing Time Jobs to Minimize the Weighted Number of Late Jobs. J. Math. Model. Algorithms 5(2): 143-165 (2006) - [i1]Philippe Baptiste, Peter Brucker, Marek Chrobak, Christoph Dürr, Svetlana A. Kravchenko, Francis Sourd:
The Complexity of Mean Flow Time Scheduling Problems with Release Times. CoRR abs/cs/0605078 (2006) - 2005
- [c1]Peter Brucker, Svetlana A. Kravchenko:
Polynomial Algorithm for Parallel Machine Mean Flow Time Scheduling Problem with Release Dates. ICCSA (4) 2005: 182-191 - 2001
- [j7]Svetlana A. Kravchenko, Frank Werner:
A heuristic algorithm for minimizing mean flow time with unit setups. Inf. Process. Lett. 79(6): 291-296 (2001) - 2000
- [j6]Svetlana A. Kravchenko:
Minimizing the Number of Late Jobs for the Two-machine Unit-time Job-shop Scheduling Problem. Discret. Appl. Math. 98(3): 209-217 (2000) - [j5]Svetlana A. Kravchenko:
On the complexity of minimizing the number of late jobs in unit time open shop. Discret. Appl. Math. 100(1-2): 127-132 (2000)
1990 – 1999
- 1999
- [j4]Peter Brucker, Svetlana A. Kravchenko, Yuri N. Sotskov:
Preemptive job-shop scheduling problems with a fixed number of jobs. Math. Methods Oper. Res. 49(1): 41-76 (1999) - 1998
- [j3]Svetlana A. Kravchenko:
A polynomial algorithm for a two-machine no-wait job-shop scheduling problem. Eur. J. Oper. Res. 106(1): 101-107 (1998) - [j2]Irene N. Lushchakova, Svetlana A. Kravchenko:
Two-machine shop scheduling with zero and unit processing times. Eur. J. Oper. Res. 107(2): 378-388 (1998) - 1996
- [j1]Svetlana A. Kravchenko, Yuri N. Sotskov:
Optimal makespan schedule for three jobs on two machines. Math. Methods Oper. Res. 43(2): 233-238 (1996)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-06 20:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
