default search action
Natalia V. Shakhlevich
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j43]Clément Mommessin
, Thomas Erlebach
Classification and evaluation of the algorithms for vector bin packing. Comput. Oper. Res. 173: 106860 (2025) - 2024
- [j42]Akiyoshi Shioura
Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques. Networks 83(3): 527-546 (2024) - [j41]Akiyoshi Shioura, Vitaly A. Strusevich, Natalia V. Shakhlevich
Preemptive scheduling of parallel jobs of two sizes with controllable processing times. J. Sched. 27(2): 203-224 (2024) - 2023
- [j40]Clément Mommessin, Renyu Yang, Natalia V. Shakhlevich, Xiaoyang Sun, Satish Kumar, Junqing Xiao, Jie Xu:
Affinity-aware resource provisioning for long-running applications in shared clusters. J. Parallel Distributed Comput. 177: 1-16 (2023) - 2022
- [i1]Clément Mommessin, Renyu Yang, Natalia V. Shakhlevich, Xiaoyang Sun, Satish Kumar, Junqing Xiao, Jie Xu:
Affinity-Aware Resource Provisioning for Long-Running Applications in Shared Clusters. CoRR abs/2208.12738 (2022) - 2021
- [j39]Maciej Drozdowski
Scheduling divisible loads with time and cost constraints. J. Sched. 24(5): 507-521 (2021) - 2020
- [j38]Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich
Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost. J. Glob. Optim. 76(3): 471-490 (2020)
2010 – 2019
- 2019
- [j37]Sigrid Knust, Natalia V. Shakhlevich
Shop scheduling problems with pliable jobs. J. Sched. 22(6): 635-661 (2019) - 2018
- [j36]Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich
Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: A review of solution approaches. Eur. J. Oper. Res. 266(3): 795-818 (2018) - [j35]Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich, Bernhard Primas:
Models and algorithms for energy-efficient scheduling with immediate start of jobs. J. Sched. 21(5): 505-516 (2018) - 2017
- [j34]Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich
Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints. INFORMS J. Comput. 29(4): 724-736 (2017) - [j33]Christian Weiß
Open Shop Scheduling with Synchronization. J. Sched. 20(6): 557-581 (2017) - 2016
- [j32]Christian Weiß
The assignment problem with nearly Monge arrays and incompatible partner indices. Discret. Appl. Math. 211: 183-203 (2016) - [j31]Florian Bruns, Sigrid Knust, Natalia V. Shakhlevich
Complexity results for storage loading problems with stacking constraints. Eur. J. Oper. Res. 249(3): 1074-1081 (2016) - [j30]Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich:
Application of Submodular Optimization to Single Machine Scheduling with Controllable Processing Times Subject to Release Dates and Deadlines. INFORMS J. Comput. 28(1): 148-161 (2016) - [j29]Peter Brucker, Natalia V. Shakhlevich:
Necessary and sufficient optimality conditions for scheduling unit time jobs on identical parallel machines. J. Sched. 19(6): 659-685 (2016) - [c5]Akiyoshi Shioura
Handling Scheduling Problems with Controllable Parameters by Methods of Submodular Optimization. DOOR 2016: 74-90 - [c4]Bernhard Primas, Peter Garraghan
Resource boxing: converting realistic cloud task utilization patterns for theoretical scheduling. UCC 2016: 138-147 - 2015
- [j28]Akiyoshi Shioura, Natalia V. Shakhlevich
Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times. Math. Program. 153(2): 495-534 (2015) - 2013
- [j27]Alessandro Condotta, Sigrid Knust, Dimitri Meier, Natalia V. Shakhlevich
Tabu search and lower bounds for a combined production-transportation problem. Comput. Oper. Res. 40(3): 886-900 (2013) - [j26]Konstantin Chakhlevitch, Celia A. Glass
Minimising the number of gap-zeros in binary matrices. Eur. J. Oper. Res. 229(1): 48-58 (2013) - [j25]S. S. Li, Peter Brucker, Chi To Ng
A note on reverse scheduling with maximum lateness objective. J. Sched. 16(4): 417-422 (2013) - [j24]Akiyoshi Shioura, Natalia V. Shakhlevich
A Submodular Optimization Approach to Bicriteria Scheduling Problems with Controllable Processing Times on Parallel Machines. SIAM J. Discret. Math. 27(1): 186-204 (2013) - [c3]Natalia V. Shakhlevich
Scheduling Divisible Loads to Optimize the Computation Time and Cost. GECON 2013: 138-148 - [c2]Anastasia Grekioti, Natalia V. Shakhlevich
Scheduling Bag-of-Tasks Applications to Optimize Computation Time and Cost. PPAM (2) 2013: 3-12 - 2012
- [j23]Alessandro Condotta, Natalia V. Shakhlevich
Scheduling coupled-operation jobs with exact time-lags. Discret. Appl. Math. 160(16-17): 2370-2388 (2012) - 2011
- [j22]Peter Brucker, Natalia V. Shakhlevich
Inverse scheduling: two-machine flow-shop problem. J. Sched. 14(3): 239-256 (2011) - [j21]Peter Brucker, Natalia V. Shakhlevich
A polynomial-time algorithm for a flow-shop batching problem with equal-length operations. J. Sched. 14(4): 371-389 (2011) - 2010
- [j20]Alessandro Condotta, Sigrid Knust, Natalia V. Shakhlevich
Parallel batch scheduling of equal-length jobs with release and due dates. J. Sched. 13(5): 463-477 (2010)
2000 – 2009
- 2009
- [j19]Natalia V. Shakhlevich
Single Machine Scheduling with Controllable Processing Times by submodular Optimization. Int. J. Found. Comput. Sci. 20(2): 247-269 (2009) - [j18]Peter Brucker, Natalia V. Shakhlevich
Inverse scheduling with maximum lateness objective. J. Sched. 12(5): 475-488 (2009) - 2008
- [j17]Natalia V. Shakhlevich
Preemptive Scheduling on Uniform Parallel Machines with Controllable Job Processing Times. Algorithmica 51(4): 451-473 (2008) - [c1]Natalia V. Shakhlevich, Akiyoshi Shioura, Vitaly A. Strusevich:
Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times - A Polymatroid Optimization Approach. ESA 2008: 756-767 - 2007
- [j16]T. C. Edwin Cheng
Two-machine open shop problem with controllable processing times. Discret. Optim. 4(2): 175-184 (2007) - 2006
- [j15]Natalia V. Shakhlevich
Single machine scheduling with controllable release and processing parameters. Discret. Appl. Math. 154(15): 2178-2199 (2006) - [j14]T. C. Edwin Cheng
Scheduling with controllable release dates and processing times: Makespan minimization. Eur. J. Oper. Res. 175(2): 751-768 (2006) - [j13]T. C. Edwin Cheng
Scheduling with controllable release dates and processing times: Total completion time minimization. Eur. J. Oper. Res. 175(2): 769-781 (2006) - 2005
- [j12]Natalia V. Shakhlevich
Open shop unit-time scheduling problems with symmetric objective functions. 4OR 3(2): 117-131 (2005) - [j11]T. C. Edwin Cheng
Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem. Eur. J. Oper. Res. 165(2): 444-456 (2005) - [j10]Natalia V. Shakhlevich
Pre-Emptive Scheduling Problems with Controllable Processing Times. J. Sched. 8(3): 233-253 (2005) - 2004
- [j9]Peter Brucker, Sigrid Knust, T. C. Edwin Cheng
Complexity Results for Flow-Shop and Open-Shop Scheduling Problems with Transportation Delays. Ann. Oper. Res. 129(1-4): 81-106 (2004) - 2003
- [j8]T. C. Edwin Cheng
Single Machine Scheduling of Unit-time Jobs with Controllable Release Dates. J. Glob. Optim. 27(2-3): 293-311 (2003) - 2002
- [j7]T. C. Edwin Cheng
Common due date assignment and scheduling with ready times. Comput. Oper. Res. 29(14): 1957-1967 (2002) - [j6]Vitaly A. Strusevich, Inna G. Drobouchevitch, Natalia V. Shakhlevich:
Three-machine shop scheduling with partially ordered processing routes. J. Oper. Res. Soc. 53(5): 574-582 (2002) - 2000
- [j5]Natalia V. Shakhlevich
Complexity of mixed shop scheduling problems: A survey. Eur. J. Oper. Res. 120(2): 343-351 (2000)
1990 – 1999
- 1999
- [j4]Natalia V. Shakhlevich, Yuri N. Sotskov, Frank Werner:
Shop‐scheduling problems with fixed and non‐fixedmachine orders of the jobs. Ann. Oper. Res. 92: 281-304 (1999) - 1998
- [j3]Heidemarie Bräsel, Natalia V. Shakhlevich:
On the solution region for certainscheduling problems with preemption. Ann. Oper. Res. 83: 1-22 (1998) - 1995
- [j2]Yuri N. Sotskov, Natalia V. Shakhlevich
NP-hardness of Shop-scheduling Problems with Three Jobs. Discret. Appl. Math. 59(3): 237-266 (1995) - 1994
- [j1]Natalia V. Shakhlevich
Scheduling two jobs with fixed and nonfixed routes. Computing 52(1): 17-30 (1994)
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-11-07 21:35 CET 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: