Vladimir Kats

According to our database, Vladimir Kats authored at least 22 papers between 1997 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2024

Fast Algorithm for High-Throughput Screening Scheduling Based on the PERT/CPM Project Management Technique.

Eugene Levner, Vladimir Kats, Pengyu Yan, Ada Che

Algorithms, March, 2024

2018

On the existence of dominating 6-cyclic schedules in four-machine robotic cells.

Vladimir Kats, Eugene Levner

Eur. J. Oper. Res., 2018

2017

An efficient bicriteria algorithm for stable robotic flow shop scheduling.

Ada Che, Vladimir Kats, Eugene Levner

Eur. J. Oper. Res., 2017

2015

Energy consumption minimization for single machine scheduling with bounded maximum tardiness.

Ada Che, Ke Lv, Eugene Levner, Vladimir Kats

Proceedings of the 12th IEEE International Conference on Networking, Sensing and Control, 2015

2013

A note on periodic schedules for linear precedence constraints.

Vladimir Kats, Eugene Levner

Discret. Appl. Math., 2013

2012

Cyclic Flowshop Scheduling with Operators and Robots: Vyacheslav Tanaev's Vision and Lasting Contributions.

Vladimir Kats, Eugene Levner

J. Sched., 2012

2011

Parametric algorithms for 2-cyclic robot scheduling with interval processing times.

Vladimir Kats, Eugene Levner

J. Sched., 2011

A faster algorithm for 2-cyclic robotic scheduling with a fixed robot route and interval processing times.

Vladimir Kats, Eugene Levner

Eur. J. Oper. Res., 2011

Cyclic routing algorithms in graphs: Performance analysis and applications to robot scheduling.

Vladimir Kats, Eugene Levner

Comput. Ind. Eng., 2011

2010

Complexity of cyclic scheduling problems: A state-of-the-art survey.

Eugene Levner, Vladimir Kats, David Alcaide López de Pablo, T. C. Edwin Cheng

Comput. Ind. Eng., 2010

2009

A note on a quadratic algorithm for the 2-cyclic robotic scheduling problem.

Ada Che, Vladimir Kats, Eugene Levner

Theor. Comput. Sci., 2009

A polynomial algorithm for 2-cyclic robotic scheduling: A non-Euclidean case.

Vladimir Kats, Eugene Levner

Discret. Appl. Math., 2009

2008

Minimizing the cycle time of multiple-product processing networks with a fixed operation sequence, setups, and time-window constraints.

Vladimir Kats, Lei Lei, Eugene Levner

Eur. J. Oper. Res., 2008

Parametric Algorithms for Cyclic Scheduling Problems with Applications to Robotics.

Vladimir Kats, Eugene Levner

Proceedings of the MICAI 2008: Advances in Artificial Intelligence, 2008

2007

Cyclic multiple-robot scheduling with time-window constraints using a critical path approach.

David Alcaide, Chengbin Chu, Vladimir Kats, Eugene Levner, Gerard Sierksma

Eur. J. Oper. Res., 2007

2006

A Polynomial Algorithm for 2-Cyclic Robotic Scheduling.

Vladimir Kats, Eugene Levner

Proceedings of the MICAI 2006: Advances in Artificial Intelligence, 2006

2000

Cyclic scheduling in robotic flowshops.

Yves Crama, Vladimir Kats, Joris van de Klundert, Eugene Levner

Ann. Oper. Res., 2000

1999

Multiple-part cyclic hoist scheduling using a sieve method.

Vladimir Kats, Eugene Levner, Leonid K. Meyzin

IEEE Trans. Robotics Autom., 1999

1998

Minimizing the number of vehicles in periodic scheduling: The non-Euclidean case.

Vladimir Kats, Eugene Levner

Eur. J. Oper. Res., 1998

A Parametric Critical Path Problem and an Application for Cyclic Scheduling.

Eugene Levner, Vladimir Kats

Discret. Appl. Math., 1998

1997

A strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling.

Vladimir Kats, Eugene Levner

Oper. Res. Lett., 1997

Minimizing the number of robots to meet a given cyclic schedule.

Vladimir Kats, Eugene Levner

Ann. Oper. Res., 1997