people / Daria Terekhov
PhD Candidate - Department of Mechanical and Industrial Engineering, University of Toronto
Master of Applied Science in Operations Research (University of Toronto, 2007)
Bachelor of Mathematics in Operations Research (University of Waterloo, 2005)
Current Research
In a real scheduling problem, the set of jobs (customers/requests/tasks) to be scheduled changes dynamically over time, each job has specific processing requirements and the actual processing times of jobs are affected by various types of uncertainty. In order to solve such problems, an approach is needed that can handle their combinatorial structure as well as their stochastic and dynamic nature. Scheduling research has mostly focused on devising effective methods for solving deterministic problems with a complex combinatorial structure, although there has recently been an increasing interest in modelling and solving of scheduling problems in dynamic and uncertain environments. In queueing theory, on the other hand, scheduling problems with a simpler combinatorial structure but with stochastic and dynamic characteristics have been considered for a long time. The main objective of my research is to develop an effective methodology for solving scheduling problems arising in dynamic and uncertain environments based on the integration of approaches from the scheduling and queueing theory literature. Currently, I am investigating different ways of integrating methods from these two areas in the context of a dynamic flow shop system.
Publications and Working Papers:
Refereed Journals
Terekhov, D., Dogru, M. K., Ozen, U., & Beck, J. C. Solving Two-Machine Assembly Scheduling Problems with Inventory Constraints, Computers and Industrial Engineering, accepted February 2012.
Terekhov, D., Beck, J.C., & Brown, K.N., A Constraint Programming Approach for Solving a Queueing Design and Control Problem, INFORMS Journal on Computing, 21(4), 549-561, 2009.
Terekhov, D. & Beck, J.C., An Extended Queueing Control Model for Facilities with Front Room and Back Room Operations and Mixed-Skilled Workers, European Journal of Operational Research, 198(1), 223-231, 2009.
Terekhov, D. & Beck, J.C., A Constraint Programming Approach for Solving a Queueing Control Problem,
Journal of Artificial Intelligence Research, 32, 123-167, 2008.
Refereed Conferences
Terekhov, D., Tran, T.T., Down, D. G., & J. C. Beck. Long-run Stability in Dynamic Scheduling, Proceedings of the Twenty-Second International Conference on Automated Planning and Scheduling (ICAPS'12), accepted February 2012.
Terekhov, D. Beck, J.C., & Brown, K.N., Solving a Stochastic Queueing Design and Control Problem with Constraint Programming, Proceedings of the Twenty-Second Conference on Artificial Intelligence (AAAI'07), 2007.
Terekhov, D. & Beck, J.C., Solving a Stochastic Queueing Control Problem with Constraint Programming, Proceedings of the Fourth International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems (CPAIOR'07), 2007.
Workshops
Terekhov, D., Tran, T.T., & J. C. Beck. Investigating Two-Machine Dynamic Flow Shops Based on Queueing and Scheduling, Proceedings of ICAPS'10 Workshop on Planning and Scheduling Under Uncertainty, Toronto, Canada, 2010.
Working Papers
Terekhov, D., Down, D.G., & Beck, J. C. "Queueing Theory Approaches for Dynamic Scheduling: A Survey", under revision for
Journal of Scheduling.
Terekhov, D., Down, D.G., & Beck, J. C. "Stability of a Polling System with a Flow Shop Server".
Contact Information:
Email: dterekho mie.utoronto.ca
|
