Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Vladimir Kats
Information about the author Vladimir Kats will soon be added to the site.
Found
10 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Cyclic routing algorithms in graphs: Performance analysis and applications to robot scheduling
2011
In this paper we revisit and extend the algorithm for the cyclic project scheduling...
Complexity of cyclic scheduling problems: A state‐of‐the‐art survey
2010
In this survey we review the current complexity status of basic cyclic scheduling...
Parametric algorithms for 2‐cyclic robot scheduling with interval processing times
2011
Consider an m -machine production line for processing identical parts served by a...
A faster algorithm for 2-cyclic robotic scheduling with a fixed robot route and interval processing times
2011
Consider an m -machine production line for processing identical parts served by a...
Cyclic multiple-robot scheduling with time-window constraints using a critical path approach
2007
An automated production system is considered in which several robots are used for...
Cyclic scheduling in a robotic production line
2002
The solution of cyclic scheduling problems is part of the classical repertoire on...
Minimizing the number of vehicles in periodic scheduling: The non-Euclidean case
1998
In this paper we consider the problem of minimizing the number of vehicles needed to...
An improved algorithm for cyclic flowshop scheduling in a robotic cell
1997
This paper addresses a cyclic robot scheduling problem in an automated manufacturing...
Cyclic scheduling of operations for a part type in a flexible manufacturing system handled by a single robot: A parametric critical-path approach
1998
We consider two problems of periodic scheduling of parts in a robotic production...
Minimizing the number of robots to meet a given cyclic schedule
1997
The authors study a problem of cyclic no-wait scheduling of identical parts on m...
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers