Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

University of British Columbia

$42,000.00

Optimization models and methods in Operations Management

EF 2019-20

Résumé
We study and develop optimization models and methods for decision problems in Operations Management, along five main research directions.***(1) Submodularity and lattices are mathematical structures that arise in fields such as discrete mathematics, operations research, artificial intelligence, microeconomics and game theory. We study the structure of algebraic lattices and submodular optimization problems, and the development of algorithms for partitioning problems with submodular costs. We also investigate computational properties of methods combining discrete convexity and stochastic optimization for scheduling of surgeries in a hospital in the presence of uncertain operations durations***(2) Minimum cuts in graphs and hypergraphs form a special case of such partitioning problems, with applications to various areas of engineering and discrete optimization. We investigate algorithmic consequences of the remarkable structural properties of global minimum cuts, in particular randomized algorithms and the tradeoffs between probability of success and running time. We also study partitioning problems with submodular part costs subject to minimum part size constraints.***(3) In partitioning, clustering and location problems, it is often desirable that the parts (clusters, regions) have “nice shapes”, or at least are “not too odd”. We plan to investigate formulations and properties of such shape constraints, particularly within mixed-integer programming formulations, as well as “dual” optimization problems of finding maximum weight subsets satisfying such constraints.***(4) Surface and underground mine planning and sequencing: in collaborative research projects we study the solution of open pit mine sequencing projects that induce highly structured but huge integer programming models (with tens of millions of variables and constraints); and the use of continuous-space (and continuous-time) infinite-dimensional optimization models as alternatives to these huge discrete models.***(5) Scheduling methods and applications, in particular for weighted sums of completion times objectives. We study the computational complexity of a continuous relaxation, based on mean busy dates, for very general single-stage scheduling environments; and problems that include the scheduling of maintenance activities, during which the machines are not available for processing.******This research program is expected to contribute to fundamental knowledge and, through its applications, to several sectors of the Canadian economy and of the Canadian society, for example by helping to reduce waiting time in the Canadian health care system.**
Programme
Discovery Grants Program - Individual
Emplacement
British Columbia, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
RGPIN-2016-04617
Name nom
Queyranne, Maurice
Department département
Sauder School of Business
Organization id
2
Institution établissement
University of British Columbia
Province en
British Columbia
Province fr
Colombie-Britannique
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2019
Competition year année de concours
2016
Award amount
42000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
DISCOVERY RESEARCH
Group fr
RECHERCHE AXÉE SUR 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
4
Nb partie
5
Application title
Optimization models and methods in Operations Management
Keyword
NSERC
Application summary
We study and develop optimization models and methods for decision problems in Operations Management, along five main research directions.***(1) Submodularity and lattices are mathematical structures that arise in fields such as discrete mathematics, operations research, artificial intelligence, microeconomics and game theory. We study the structure of algebraic lattices and submodular optimization problems, and the development of algorithms for partitioning problems with submodular costs. We also investigate computational properties of methods combining discrete convexity and stochastic optimization for scheduling of surgeries in a hospital in the presence of uncertain operations durations***(2) Minimum cuts in graphs and hypergraphs form a special case of such partitioning problems, with applications to various areas of engineering and discrete optimization. We investigate algorithmic consequences of the remarkable structural properties of global minimum cuts, in particular randomized algorithms and the tradeoffs between probability of success and running time. We also study partitioning problems with submodular part costs subject to minimum part size constraints.***(3) In partitioning, clustering and location problems, it is often desirable that the parts (clusters, regions) have “nice shapes”, or at least are “not too odd”. We plan to investigate formulations and properties of such shape constraints, particularly within mixed-integer programming formulations, as well as “dual” optimization problems of finding maximum weight subsets satisfying such constraints.***(4) Surface and underground mine planning and sequencing: in collaborative research projects we study the solution of open pit mine sequencing projects that induce highly structured but huge integer programming models (with tens of millions of variables and constraints); and the use of continuous-space (and continuous-time) infinite-dimensional optimization models as alternatives to these huge discrete models.***(5) Scheduling methods and applications, in particular for weighted sums of completion times objectives. We study the computational complexity of a continuous relaxation, based on mean busy dates, for very general single-stage scheduling environments; and problems that include the scheduling of maintenance activities, during which the machines are not available for processing.******This research program is expected to contribute to fundamental knowledge and, through its applications, to several sectors of the Canadian economy and of the Canadian society, for example by helping to reduce waiting time in the Canadian health care system.**