Grant: Discovery Grants Program - Individual
The University of British Columbia
$42,000.00
Optimization models and methods in Operations Management
EF 2023-24
Résumé
We study and develop optimization models and methods for decision problems in Operations Management, along six main research directions. (1) Submodularity and lattices are mathematical structures that arise in discrete mathematics, operations research, artificial intelligence, microeconomics and game theory. We continue our work on submodular structures and optimization in lattices, in particular on parametric lattice optimization. We also investigate computational properties of methods combining discrete convexity and stochastic optimization for scheduling of surgeries with uncertain operations durations. (2) Minimum cuts in graphs and hypergraphs are a special case of partitioning problems with submodular part costs, with applications to various areas of discrete optimization. Global minimum cuts have remarkable structural properties, in particular polynomially bounded numbers of approximate optima and of Pareto efficient solutions in multi-objective problems. We investigate further structural and algorithmic consequences of these properties. (3) In many partitioning, clustering and location problems, it is often desirable that the parts (clusters, regions) have "nice shapes", or at least are not "too odd". These informal shape requirements are generally hard to express and are subject to various interpretations in different contexts (e.g., mining, forestry, facility location, data mining, political districting). We investigate properties and mixed-integer programming formulations of such constraints, as well as "dual" optimization problems of finding optimum weight subsets satisfying such constraints. (4) Mine planning and sequencing lead to challenging optimization problems that often possess geometric or combinatorial structures. For instance, open pit mine planning is usually approached using space and time discretization, resulting in highly structured but huge integer programming models. We investigate the use of continuous-space (and continuous-time) infinite-dimensional optimization models as alternatives to these huge discrete models. (5) We continue our studies of machine scheduling problems, in particular of problems related to minimizing weighted sums of completion times. We investigate properties of continuous relaxations, based on mean busy dates, for very general classes of scheduling environments, as well as multi-agent versions of these problems. (6) Supply chain and revenue management give rise to numerous problems involving optimization and economics. We will expand our study of assortment planning models, of multiproduct pricing in various economic environments, and of related models and problems. This research program contributes to fundamental knowledge and to the training of highly qualified personnel, as well as to the Canadian economy and the Canadian society, for example by helping to improve the management of supply chains, and reduce waiting time in the Canadian health care system.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
British Columbia, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data
Tel que publié
Application id
RGPIN-2023-05388
Name nom
Queyranne, Maurice
Department département
Sauder School of Business
Organization id
2
Institution établissement
The University of British Columbia
Province en
British Columbia
Province fr
Colombie-Britannique
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2023
Competition year année de concours
2023
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
Operations research and management science
Research subject en
Génie industriel
Research subject fr
Recherche opérationnelle et science de la gestion
Application title
Optimization models and methods in Operations Management
Keyword
Convexity; Machine Scheduling; Management Science; Mine Planning; Operations Management; Operations Research; Optimization; Revenue Management; Submodularity; Supply Chain Management
Application summary
We study and develop optimization models and methods for decision problems in Operations Management, along six main research directions. (1) Submodularity and lattices are mathematical structures that arise in discrete mathematics, operations research, artificial intelligence, microeconomics and game theory. We continue our work on submodular structures and optimization in lattices, in particular on parametric lattice optimization. We also investigate computational properties of methods combining discrete convexity and stochastic optimization for scheduling of surgeries with uncertain operations durations. (2) Minimum cuts in graphs and hypergraphs are a special case of partitioning problems with submodular part costs, with applications to various areas of discrete optimization. Global minimum cuts have remarkable structural properties, in particular polynomially bounded numbers of approximate optima and of Pareto efficient solutions in multi-objective problems. We investigate further structural and algorithmic consequences of these properties. (3) In many partitioning, clustering and location problems, it is often desirable that the parts (clusters, regions) have "nice shapes", or at least are not "too odd". These informal shape requirements are generally hard to express and are subject to various interpretations in different contexts (e.g., mining, forestry, facility location, data mining, political districting). We investigate properties and mixed-integer programming formulations of such constraints, as well as "dual" optimization problems of finding optimum weight subsets satisfying such constraints. (4) Mine planning and sequencing lead to challenging optimization problems that often possess geometric or combinatorial structures. For instance, open pit mine planning is usually approached using space and time discretization, resulting in highly structured but huge integer programming models. We investigate the use of continuous-space (and continuous-time) infinite-dimensional optimization models as alternatives to these huge discrete models. (5) We continue our studies of machine scheduling problems, in particular of problems related to minimizing weighted sums of completion times. We investigate properties of continuous relaxations, based on mean busy dates, for very general classes of scheduling environments, as well as multi-agent versions of these problems. (6) Supply chain and revenue management give rise to numerous problems involving optimization and economics. We will expand our study of assortment planning models, of multiproduct pricing in various economic environments, and of related models and problems. This research program contributes to fundamental knowledge and to the training of highly qualified personnel, as well as to the Canadian economy and the Canadian society, for example by helping to improve the management of supply chains, and reduce waiting time in the Canadian health care system.