dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Vladimir Kats Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2012
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVladimir Kats, Eugene Levner: Cyclic Flowshop Scheduling with Operators and Robots: Vyacheslav Tanaev's Vision and Lasting Contributions. J. Scheduling 15(4): 419-425 (2012)
2011
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVladimir Kats, Eugene Levner: Cyclic routing algorithms in graphs: Performance analysis and applications to robot scheduling. Computers & Industrial Engineering 61(2): 279-288 (2011)
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVladimir Kats, Eugene Levner: A faster algorithm for 2-cyclic robotic scheduling with a fixed robot route and interval processing times. European Journal of Operational Research 209(1): 51-56 (2011)
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVladimir Kats, Eugene Levner: Parametric algorithms for 2-cyclic robot scheduling with interval processing times. J. Scheduling 14(3): 267-279 (2011)
2010
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEugene Levner, Vladimir Kats, David Alcaide López de Pablo, T. C. Edwin Cheng: Complexity of cyclic scheduling problems: A state-of-the-art survey. Computers & Industrial Engineering 59(2): 352-361 (2010)
2009
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVladimir Kats, Eugene Levner: A polynomial algorithm for 2-cyclic robotic scheduling: A non-Euclidean case. Discrete Applied Mathematics 157(2): 339-355 (2009)
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAda 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
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVladimir Kats, Eugene Levner: Parametric Algorithms for Cyclic Scheduling Problems with Applications to Robotics. MICAI 2008: 653-663
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVladimir Kats, Lei Lei, Eugene Levner: Minimizing the cycle time of multiple-product processing networks with a fixed operation sequence, setups, and time-window constraints. European Journal of Operational Research 187(3): 1196-1211 (2008)
2007
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Alcaide, Chengbin Chu, Vladimir Kats, Eugene Levner, Gerard Sierksma: Cyclic multiple-robot scheduling with time-window constraints using a critical path approach. European Journal of Operational Research 177(1): 147-162 (2007)
2006
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVladimir Kats, Eugene Levner: A Polynomial Algorithm for 2-Cyclic Robotic Scheduling. MICAI 2006: 439-449
1998
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEugene Levner, Vladimir Kats: A Parametric Critical Path Problem and an Application for Cyclic Scheduling. Discrete Applied Mathematics 87(1-3): 149-158 (1998)
1997
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVladimir Kats, Eugene Levner: A strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling. Oper. Res. Lett. 21(4): 171-179 (1997)

Coauthor Index

1Ada Che [7]
2T. C. Edwin Cheng (T. C. E. Cheng) [9]
3Chengbin Chu [4]
4Lei Lei [5]
5Eugene Levner [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13]
6David Alcaide López de Pablo (David Alcaide) [4] [9]
7Gerard Sierksma [4]

Last update Sun Jun 3 16:06:10 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page