George Steiner

Papers

Total Citations

H-Index

About

George Steiner is a distinguished scholar in operations research and combinatorial optimization, whose work has profoundly advanced the theory and practice of scheduling in automated manufacturing systems. His primary research areas include robotic cell scheduling, the traveling salesman problem (TSP), and the computational complexity of optimization algorithms. Steiner’s major contributions lie in identifying polynomially solvable cases of the notoriously difficult TSP, particularly through the lens of permuted Monge matrices—a breakthrough that enables efficient scheduling in reentrant robotic cells. His 2005 paper on scheduling in reentrant robotic cells, with 17 citations, provides foundational algorithms and complexity analyses that guide the design of high-throughput production lines. A second highly cited work, also from 2005, explores special TSP cases on permuted Monge matrices, garnering 10 citations and demonstrating how structural properties can be exploited for practical solutions. Steiner’s research bridges theoretical rigor and industrial application, offering elegant mathematical insights that reduce exponential complexity to polynomial time. His achievements have influenced both academic research and real-world automation, making him a key figure in the optimization community. For students and researchers, Steiner’s work exemplifies how deep theoretical understanding can unlock efficient solutions to complex scheduling problems.