default search action
Vladimir Kats
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j22]Eugene Levner, Vladimir Kats, Pengyu Yan, Ada Che:
Fast Algorithm for High-Throughput Screening Scheduling Based on the PERT/CPM Project Management Technique. Algorithms 17(3): 127 (2024) - [j21]Vladimir Kats, Eugene Levner:
Maximizing the Average Environmental Benefit of a Fleet of Drones under a Periodic Schedule of Tasks. Algorithms 17(7): 283 (2024) - [j20]Alexander Ptuskin
, Eugene Levner, Vladimir Kats:
Cyclic multi-hoist scheduling with fuzzy processing times in flexible manufacturing lines. Appl. Soft Comput. 165: 112014 (2024) - [j19]Jianguang Feng
Scheduling robotic cells with fixed processing times or time windows: Classification, solution approaches, polynomial algorithms and complexity. Eur. J. Oper. Res. 319(2): 468-483 (2024)
2010 – 2019
- 2018
- [j18]Vladimir Kats, Eugene Levner:
On the existence of dominating 6-cyclic schedules in four-machine robotic cells. Eur. J. Oper. Res. 268(2): 755-759 (2018) - 2017
- [j17]Ada Che, Vladimir Kats, Eugene Levner:
An efficient bicriteria algorithm for stable robotic flow shop scheduling. Eur. J. Oper. Res. 260(3): 964-971 (2017) - 2015
- [c3]Ada Che, Ke Lv, Eugene Levner, Vladimir Kats:
Energy consumption minimization for single machine scheduling with bounded maximum tardiness. ICNSC 2015: 146-150 - 2013
- [j16]Vladimir Kats, Eugene Levner:
A note on periodic schedules for linear precedence constraints. Discret. Appl. Math. 161(3): 430-434 (2013) - 2012
- [j15]Vladimir Kats, Eugene Levner:
Cyclic Flowshop Scheduling with Operators and Robots: Vyacheslav Tanaev's Vision and Lasting Contributions. J. Sched. 15(4): 419-425 (2012) - 2011
- [j14]Vladimir Kats, Eugene Levner:
Cyclic routing algorithms in graphs: Performance analysis and applications to robot scheduling. Comput. Ind. Eng. 61(2): 279-288 (2011) - [j13]Vladimir Kats, Eugene Levner:
A faster algorithm for 2-cyclic robotic scheduling with a fixed robot route and interval processing times. Eur. J. Oper. Res. 209(1): 51-56 (2011) - [j12]Vladimir Kats, Eugene Levner:
Parametric algorithms for 2-cyclic robot scheduling with interval processing times. J. Sched. 14(3): 267-279 (2011) - 2010
- [j11]Eugene Levner, Vladimir Kats, David Alcaide López de Pablo
Complexity of cyclic scheduling problems: A state-of-the-art survey. Comput. Ind. Eng. 59(2): 352-361 (2010)
2000 – 2009
- 2009
- [j10]Vladimir Kats, Eugene Levner:
A polynomial algorithm for 2-cyclic robotic scheduling: A non-Euclidean case. Discret. Appl. Math. 157(2): 339-355 (2009) - [j9]Ada Che, Vladimir Kats, Eugene Levner:
A note on a quadratic algorithm for the 2-cyclic robotic scheduling problem. Theor. Comput. Sci. 410(47-49): 5188-5190 (2009) - 2008
- [j8]Vladimir Kats, Lei Lei, Eugene Levner:
Minimizing the cycle time of multiple-product processing networks with a fixed operation sequence, setups, and time-window constraints. Eur. J. Oper. Res. 187(3): 1196-1211 (2008) - [c2]Vladimir Kats, Eugene Levner:
Parametric Algorithms for Cyclic Scheduling Problems with Applications to Robotics. MICAI 2008: 653-663 - 2007
- [j7]David Alcaide
Cyclic multiple-robot scheduling with time-window constraints using a critical path approach. Eur. J. Oper. Res. 177(1): 147-162 (2007) - 2006
- [c1]Vladimir Kats, Eugene Levner:
A Polynomial Algorithm for 2-Cyclic Robotic Scheduling. MICAI 2006: 439-449 - 2000
- [j6]Yves Crama, Vladimir Kats, Joris van de Klundert, Eugene Levner:
Cyclic scheduling in robotic flowshops. Ann. Oper. Res. 96(1-4): 97-124 (2000)
1990 – 1999
- 1999
- [j5]Vladimir Kats, Eugene Levner, Leonid K. Meyzin:
Multiple-part cyclic hoist scheduling using a sieve method. IEEE Trans. Robotics Autom. 15(4): 704-713 (1999) - 1998
- [j4]Eugene Levner, Vladimir Kats:
A Parametric Critical Path Problem and an Application for Cyclic Scheduling. Discret. Appl. Math. 87(1-3): 149-158 (1998) - [j3]Vladimir Kats, Eugene Levner:
Minimizing the number of vehicles in periodic scheduling: The non-Euclidean case. Eur. J. Oper. Res. 107(2): 371-377 (1998) - 1997
- [j2]Vladimir Kats, Eugene Levner:
Minimizing the number of robots to meet a given cyclic schedule. Ann. Oper. Res. 69: 209-226 (1997) - [j1]Vladimir Kats, Eugene Levner:
A strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling. Oper. Res. Lett. 21(4): 171-179 (1997)
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-12-10 21:41 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: