Eric Torng

Papers

Total Citations

H-Index

About

Eric Torng’s research lies at the intersection of online algorithms, scheduling theory, and wireless sensor networks, with a focus on optimizing performance under uncertainty. His early work pioneered the use of competitive analysis to evaluate online scheduling strategies for networked reprographic machines, demonstrating how theoretical models could directly improve real-world product development. This foundational paper, “Online Scheduling with Lookahead: Multipass Assembly Lines” (1998, 16 citations), remains a key reference for applying computational theory to manufacturing systems. Torng later expanded into wireless sensor networks, where he investigated how mobile relays could dramatically enhance data gathering capacity. His 2010 paper on this topic (14 citations) showed that controlled mobility—using low-cost robotic units like Packbots or Kheperas—could overcome traditional static sensor limitations, enabling more efficient and scalable data collection. This work has influenced subsequent research on energy-efficient network design and autonomous systems. Torng’s contributions bridge rigorous algorithmic analysis with practical engineering challenges, making his research valuable for students and researchers working on scheduling, robotics, or networked systems. His ability to translate complex theoretical concepts into deployable solutions underscores his impact across both computer science theory and applied sensor networks.