Eugene Levner

About

Eugene Levner is a distinguished operations research scholar whose career has been defined by groundbreaking contributions to cyclic scheduling theory, particularly within robotic and automated manufacturing environments. His work sits at the intersection of combinatorial optimization, algorithm design, and industrial automation, addressing the complex challenge of coordinating robots and machines in repetitive production cycles. Levner's most celebrated contributions include his seminal investigations into robotic flowshop scheduling, with his 2000 paper on cyclic scheduling in robotic flowshops accumulating nearly 200 citations — a testament to its foundational influence on the field. Alongside collaborators, he developed a series of increasingly efficient algorithms, including strongly polynomial and improved cyclic scheduling solutions published in the late 1990s, which collectively shaped how researchers approach robot-cell optimization problems. His 2002 work extended these models to multi-robot production lines, tackling the difficult problem of coordinating several robots simultaneously. Beyond single-product systems, Levner broadened the scope of cyclic scheduling to encompass multiple-product networks with time-window constraints and setup considerations, demonstrating remarkable versatility. With over 680 cumulative citations across his top works, his research remains essential reading for scholars in scheduling theory, robotics, and intelligent manufacturing systems.

Research Focus

Key Achievements

Top Papers

1. 1
   Cyclic scheduling in robotic flowshops

   196 citations · 2000
2. 2
   An improved algorithm for cyclic flowshop scheduling in a robotic cell

   115 citations · 1997
3. 3
   Cyclic scheduling in a robotic production line

   69 citations · 2002
4. 4
   A polynomial algorithm for 2-degree cyclic robot scheduling

   63 citations · 2002
5. 5
   Minimizing the number of robots to meet a given cyclic schedule

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

   45 citations · 2006
7. 7
   A strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling

   45 citations · 1997
8. 8
   A faster algorithm for 2-cyclic robotic scheduling with a fixed robot route and interval processing times

   35 citations · 2010
9. 9
   Scheduling a two-machine robotic cell: A solvable case

   35 citations · 1995
10. 10
    Cyclic multiple-robot scheduling with time-window constraints using a critical path approach

    33 citations · 2006

Key Collaborators

Contact & Links