Grant: Discovery Grants Program - Individual
Concordia University
$20,000.00
Data-driven Dynamic Scheduling
EF 2020-21
Résumé
In dynamic scheduling problems, the aim is to optimally assign arriving jobs (e.g., product orders in manufacturing; patients in healthcare) to resources (e.g., machines in manufacturing; nurses in healthcare) over time in a continuously-changing environment (e.g., machines break down; new more urgent patients arrive).
While many optimization methods for scheduling have been proposed and implemented in scheduling software, in practice the resulting optimal' schedules are not necessarily acceptable to the end users. Frequently, the schedules are manually modified before implementation, and, if the schedules repeatedly do not meet user expectations, the software itself might be discarded. The main premise of this proposal is that the true characteristics of the system and user preferences are captured by the data collected about the problem and its past (implemented) solutions, and that as a result the mismatch between the schedules created by software and those desired by the user can be reduced or eliminated through data-driven modelling.
Modern information systems are capable of collecting data on past job and resource characteristics (e.g., arrival times, processing times), real-time system status updates (e.g., number of jobs currently in the system), and past scheduling decisions (e.g., decisions made by managers in the past). Traditionally, each of these data sources has been considered in isolation by distinct research areas, namely queueing theory, classical scheduling, and inverse scheduling, respectively.
My research program will leverage the availability of both historical and real-time system and preference data through the integration of combinatorial scheduling, queueing theory and inverse optimization techniques. The resulting hybrid scheduling models will capture system characteristics and user preferences better than traditional approaches, producing schedules that would be more readily accepted by the users. Thus, this research has the potential to increase the adoption of scheduling software in practice, which will in turn lead to greater productivity and efficiency of those systems.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Quebec, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data
Tel que publié
Application id
RGPIN-2017-06687
Name nom
Terekhov, Daria
Department département
Mechanical and Industrial Engineering
Organization id
70
Institution établissement
Concordia University
Province en
Québec
Province fr
Québec
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2020
Competition year année de concours
2017
Award amount
20000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
1509
Committee name en
Civil, Industrial and Systems Engineering
Committee name fr
Génie civil, industriel et des systèmes
Area of application code
520
Area of application group en
Manufacturing processes and products
Area of application group fr
Procédés et produits industriels
Area of application en
Production and operations management
Area of application fr
Production et gestion des opérations
Research subject code
1601
Research subject group en
Industrial engineering
Research subject group fr
Génie industriel
Research subject en
Operations research and management science
Research subject fr
Recherche opérationnelle et science de la gestion
Installment
inst:4-5
Partie
2
Nb partie
5
Application title
Data-driven Dynamic Scheduling
Keyword
NSERC
Application summary
In dynamic scheduling problems, the aim is to optimally assign arriving jobs (e.g., product orders in manufacturing; patients in healthcare) to resources (e.g., machines in manufacturing; nurses in healthcare) over time in a continuously-changing environment (e.g., machines break down; new more urgent patients arrive).
While many optimization methods for scheduling have been proposed and implemented in scheduling software, in practice the resulting optimal' schedules are not necessarily acceptable to the end users. Frequently, the schedules are manually modified before implementation, and, if the schedules repeatedly do not meet user expectations, the software itself might be discarded. The main premise of this proposal is that the true characteristics of the system and user preferences are captured by the data collected about the problem and its past (implemented) solutions, and that as a result the mismatch between the schedules created by software and those desired by the user can be reduced or eliminated through data-driven modelling.
Modern information systems are capable of collecting data on past job and resource characteristics (e.g., arrival times, processing times), real-time system status updates (e.g., number of jobs currently in the system), and past scheduling decisions (e.g., decisions made by managers in the past). Traditionally, each of these data sources has been considered in isolation by distinct research areas, namely queueing theory, classical scheduling, and inverse scheduling, respectively.
My research program will leverage the availability of both historical and real-time system and preference data through the integration of combinatorial scheduling, queueing theory and inverse optimization techniques. The resulting hybrid scheduling models will capture system characteristics and user preferences better than traditional approaches, producing schedules that would be more readily accepted by the users. Thus, this research has the potential to increase the adoption of scheduling software in practice, which will in turn lead to greater productivity and efficiency of those systems.