Jie Min

Papers

Total Citations

H-Index

About

Jie Min is a theoretical computer scientist whose work lies at the intersection of scheduling theory, online algorithms, and search problems. Their most influential contribution is the formulation and analysis of the "Bamboo Garden Trimming Problem," a novel scheduling model where machines with different urgency factors must be perpetually maintained—a problem with deep implications for real-time systems and resource allocation. This foundational 2017 paper has garnered 31 citations, establishing Min as a key voice in perpetual maintenance scheduling. Building on this, their 2023 work on machines with varying urgency requirements (10 citations) extends the model to more practical, heterogeneous settings. Min has also made notable contributions to search theory, particularly in "Searching with Increasing Speeds" (2018, 6 citations), which explores how searchers can optimize their strategy when their speed changes over time. Their research is characterized by elegant mathematical modeling of real-world constraints, offering both theoretical depth and practical insights. For students and researchers, Min’s work provides a compelling bridge between classic scheduling problems and modern, dynamic maintenance challenges.