Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

University of Waterloo

$23,000.00

Novel mathematical models for optimal screening and multicriteria scheduling problems

EF 2014-15

Résumé
The proposed research consists of two related lines of research. Our first research stream explores the problem of determining the optimal screening schedule of a system that stochastically deteriorates towards failure. Screenings provide imperfect information about the current deterioration level of the system, based on which optimal preventative actions (i.e., replacement, repair) are determined. This problem is of great importance for various practical applications including disease screening. In particular, the modeling framework developed for this problem can be used in optimizing preventative cancer screening, which may have a significant impact on the society. In this context, we explore novel modeling frameworks for the optimal screening problem based on Markov decision processes and control theory. We will analyze these complex models to prove the existence of certain structural properties. We will use such properties to develop faster solution algorithms to solve this problem. In addition, we develop a solution method for multi-objective optimal screening problems which determine the Pareto-optimal solutions dominating the other feasible solutions. The proposed research will also address the optimal screening problem for a population, in order to determine how limited screening resources should be allocated to the individuals within the population. As a secondary stream of research, we will develop optimal and approximate solution methods for the multicriteria scheduling problem of minimizing the number of tardy (late) jobs and weighted flow-time in order to determine Pareto-optimal schedules of particular tasks. Developing a modeling and solution framework for this problem is a significant contribution because of its practical importance in several fields. For example, in a hospital, this problem characterizes the perspective of a doctor whose objective is to increase the number of patients served within predefined time intervals and decrease the time that the patients spent in the hospital. We model and solve this multicriteria scheduling problem using MIP and Branch & Bound. We also develop approximate solution methods based on beam-search and genetic algorithms.
Programme
Discovery Grants Program - Individual
Emplacement
Ontario, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
418663-2012
Name nom
Erenay, Fatih
Department département
Management Sciences
Organization id
33
Institution établissement
University of Waterloo
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2014
Competition year année de concours
2012
Award amount
23000
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
Partie
3
Nb partie
5
Application title
Novel mathematical models for optimal screening and multicriteria scheduling problems
Keyword
NSERC
Application summary
The proposed research consists of two related lines of research. Our first research stream explores the problem of determining the optimal screening schedule of a system that stochastically deteriorates towards failure. Screenings provide imperfect information about the current deterioration level of the system, based on which optimal preventative actions (i.e., replacement, repair) are determined. This problem is of great importance for various practical applications including disease screening. In particular, the modeling framework developed for this problem can be used in optimizing preventative cancer screening, which may have a significant impact on the society. In this context, we explore novel modeling frameworks for the optimal screening problem based on Markov decision processes and control theory. We will analyze these complex models to prove the existence of certain structural properties. We will use such properties to develop faster solution algorithms to solve this problem. In addition, we develop a solution method for multi-objective optimal screening problems which determine the Pareto-optimal solutions dominating the other feasible solutions. The proposed research will also address the optimal screening problem for a population, in order to determine how limited screening resources should be allocated to the individuals within the population. As a secondary stream of research, we will develop optimal and approximate solution methods for the multicriteria scheduling problem of minimizing the number of tardy (late) jobs and weighted flow-time in order to determine Pareto-optimal schedules of particular tasks. Developing a modeling and solution framework for this problem is a significant contribution because of its practical importance in several fields. For example, in a hospital, this problem characterizes the perspective of a doctor whose objective is to increase the number of patients served within predefined time intervals and decrease the time that the patients spent in the hospital. We model and solve this multicriteria scheduling problem using MIP and Branch & Bound. We also develop approximate solution methods based on beam-search and genetic algorithms.