Ph. D (Operations Management), Washington University at St. Louis, 2004

Academic Positions Held

Current Appointment:

Assistant Professor, Singapore Management University, 2004-Present

Courses Taught in SMU

Calculus

Management Science

Supply Chain Management

Research Areas

Global Supply Chain Management

Dynamic Revenue Management

Information Technology & Supply Chain Improvement

Production Scheduling

Applications of Auction Theory

Current Projects

Continuous Review Policy in Multi-Class Customer Demand Fulfillment

Preemptive Scheduling Policy for Multiple Loan Repayment

Financial-Hedging-Contract vs. Long-term Contract in a Dual Sourcing Environment

Dynamic Pricing in Hotel Management with Multiple Day Stay

Auction with Asymmetric Information among Bidder

Selected Book, Journal & Other Publications

Ding Qing, Panos Kouvelis and Joseph Milner (2006), “Dynamic Pricing through Discounts for Optimizing Multiple Class Demand Fulfillment”, Operations Research, Vol 54, No. 1, 169-183.

Ding Qing, Lingxiu Dong, and Panos Kouvelis (2006), “On the Integration of Production and Financial Hedging Decisions in Global Markets”, accepted by Operations Research.

Ding Qing , Panos Kouvelis and Joseph M. Milner (2006), "Dynamic Pricing for Multiple Class Deterministic Demand Fulfillment", under second review in the IIE Transactions.

T. C. E. Cheng, Q. Ding and B. M. T. Lin (2004), “A Concise Survey of Scheduling with Time-Dependent Processing Times”, European Journal of Operational Research, 152/1, 1-13.

T. C. E. Cheng, Q. Ding, M.Y. Kovalyov, A. Bachman and A. Janiak (2003), “Scheduling Jobs with Linearly Decreasing Processing Times”, Naval Research Logistics, 50/6, 531-554.

T. C. E. Cheng, Q. Ding (2003), “Scheduling Start Time Dependent Tasks with Deadlines and Identical Initial Processing Times on a Single Machine”, Computers and Operations Research, 30/1, 51-62.

T. C. E. Cheng and Q. Ding (2001), “Single Machine Scheduling with Step-Deteriorating Processing Times”, European Journal of Operational Research, 134/3, 623-630.

T. C. E. Cheng and Q. Ding (2000), “Single Machine Scheduling with Deadlines and Increasing Rates of Processing Times”, Acta Informatica 36/9-10, 673-692.

T. C. E. Cheng and Q. Ding (1999), “The Time Dependent Machine Makespan Problem Is Strongly NP-Complete”, Computers and Operations Research, 26/8, 749-754.

T. C. E. Cheng and Q. Ding (1998), “The Complexity of Scheduling Starting Time Dependent Tasks with Release Times”, Information Processing Letters, 65/2, 75-79.

T. C. E. Cheng and Q. Ding (1998), “The Complexity of Single Machine Scheduling with Two Distinct Deadlines and Identical Decreasing Rates of Processing Times”, Computers and Mathematics with Applications, 35/12, 95-100.