 | 2009 |
|---|
| 24 |       | Vladimir Kats,
Eugene Levner:
A polynomial algorithm for 2-cyclic robotic scheduling: A non-Euclidean case.
Discrete Applied Mathematics 157(2): 339-355 (2009) |
| 23 | | Eugene Levner:
J. Blazewicz, K. Ecker, E. Pesch, G. Schmidt, J. Weglarz: Handbook on scheduling: from theory to applications.
J. Scheduling 12(4): 433-434 (2009) |
| 2008 |
|---|
| 22 | | Vladimir Kats,
Eugene Levner:
Parametric Algorithms for Cyclic Scheduling Problems with Applications to Robotics.
MICAI 2008: 653-663 |
| 21 | | 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.
European Journal of Operational Research 187(3): 1196-1211 (2008) |
| 2007 |
|---|
| 20 | | Eugene Levner,
David Pinto,
Paolo Rosso,
David Alcaide,
R. R. K. Sharma:
Fuzzifying Clustering Algorithms: The Case Study of MajorClust.
MICAI 2007: 821-830 |
| 19 | | Eugene Levner,
David Alcaide,
Joaquin Sicilia:
Multi-attribute Text Classification Using the Fuzzy Borda Method and Semantic Grades.
WILF 2007: 422-429 |
| 18 | | David 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 |
|---|
| 17 | | Vladimir Kats,
Eugene Levner:
A Polynomial Algorithm for 2-Cyclic Robotic Scheduling.
MICAI 2006: 439-449 |
| 16 | | Janny May-Yee Leung,
Eugene Levner:
An efficient algorithm for multi-hoist cyclic scheduling with fixed processing times.
Oper. Res. Lett. 34(4): 465-472 (2006) |
| 2004 |
|---|
| 15 | | Pedro Mejía-Alvarez,
Eugene Levner,
Daniel Mossé:
Adaptive scheduling server for power-aware real-time tasks.
ACM Trans. Embedded Comput. Syst. 3(2): 284-306 (2004) |
| 2003 |
|---|
| 14 | | Ada Che,
Chengbin Chu,
Eugene Levner:
A polynomial algorithm for 2-degree cyclic robot scheduling.
European Journal of Operational Research 145(1): 31-44 (2003) |
| 2002 |
|---|
| 13 | | Pedro Mejía-Alvarez,
Eugene Levner,
Daniel Mossé:
Power-Optimized Scheduling Server for Real-Time Tasks.
IEEE Real Time Technology and Applications Symposium 2002: 239- |
| 12 | | Pedro Mejía-Alvarez,
Eugene Levner,
Daniel Mossé:
An Integrated Heuristic Approach to Power-Aware Real-Time Scheduling.
PACS 2002: 68-83 |
| 11 | | Kunihiko Hiraishi,
Eugene Levner,
Milan Vlach:
Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs.
Computers & OR 29(7): 841-848 (2002) |
| 10 |  | David Blokh,
Eugene Levner:
An approximation algorithm with performance guarantees for the maximum traveling salesman problem on special matrices.
Discrete Applied Mathematics 119(1-2): 139-148 (2002) |
| 9 | | George M. Adelson-Velsky,
Eugene Levner:
Project Scheduling in AND-OR Graphs: A Generalization of Dijkstra's Algorithm.
Math. Oper. Res. 27(3): 504-517 (2002) |
| 2001 |
|---|
| 8 | | David Blokh,
Eugene Levner:
The Maximum Traveling Salesman Problem on Banded Matrices.
Int. J. Found. Comput. Sci. 12(6): 809-819 (2001) |
| 1998 |
|---|
| 7 | | Konstantin Kogan,
Eugene Levner:
A polynomial algorithm for scheduling small-scale manufacturing cells served by multiple robots.
Computers & OR 25(1): 53-62 (1998) |
| 6 | | Eugene Levner,
Vladimir Kats:
A Parametric Critical Path Problem and an Application for Cyclic Scheduling.
Discrete Applied Mathematics 87(1-3): 149-158 (1998) |
| 5 | | George Gens,
Eugene Levner:
An Approximate Binary Search Algorithm for the Multiple-Choice Knapsack Problem.
Inf. Process. Lett. 67(5): 261-265 (1998) |
| 1997 |
|---|
| 4 | | Vladimir Kats,
Eugene Levner:
A strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling.
Oper. Res. Lett. 21(4): 171-179 (1997) |
| 1995 |
|---|
| 3 | | Eugene Levner,
Leonid Meyzin,
Alexander Ptuskin:
Fuzzy Reasoning and Applications for Intelligent Scheduling of Robots.
Fuzzy Logic in Artificial Intelligence 1995: 57-68 |
| 1990 |
|---|
| 2 | | A. A. Fridman,
Eugene Levner:
A Survey of Some Results in Discrete Optimisation.
IPCO 1990: 231-235 |
| 1979 |
|---|
| 1 | | George Gens,
Eugene Levner:
Computational Complexity of Approximation Algorithms for Combinatorial Problems.
MFCS 1979: 292-300 |
