Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

University of Saskatchewan

$44,000.00

Scheduling Optimization of Manufacturing and Service Environments with Time-Lag Constraints

EF 2022-23

Résumé
The objective of this proposal is to further advance my research program in the realm of the no-wait and time-lag scheduling optimization. No-wait constraints denote that there should be no waiting time between consecutive operations of a job, which is a fundamental assumption in certain environments. Scheduling problems with time-lag constraints are a generalization of their no-wait version. Time-lag constraints force the jobs or the operations of the jobs to start or finish within a certain time window after the previous jobs or operations are completed. No-wait and time-lag constraints model situations in which a long delay between the starting time of an operation and the finish time of the previous operations is discouraged because it may damage or deteriorate the product. For example, in the food industry, many of the production procedures involve perishable products, i.e., once the food is prepared and cooked, it must undergo the chilling process before a certain amount of time is elapsed or it must be discarded. Similar constraints are in place in industries in which the risk of product contamination must be reduced. One can list biotechnology industries, for example, blood transfusion as such fields. Automated medical laboratories usually use a combination of minimal and maximal time-lags to schedule the chemical reactions correctly. Hall and Sriskandarajah [16] and Deppner [17] provide a comprehensive review of the applications of the problem.The proper objective functions to consider include minimizing the cost of production or the total processing time of the contracts in a factory; reducing the waiting time of the patients in a healthcare setting or clients in a government office. Another possibility is maximizing the utilization of the available resources. The mentioned problems are NP-hard. My research in this area during the past few years reveals that to solve the no-wait or time-lag scheduling problems to optimality using mathematical programming models, the problem instance should have less than 20 jobs. The proposed solution methods in this application progress the available literature by applying novel approaches to the scheduling problems that I have been studying for the past eight years. These methods include finding tight upper- or lower bounds for the optimal solution using semidefinite programming or Lagrangian relaxation; using decomposition techniques such as Bender's method; and conducting stochastic optimization techniques to the non-deterministic cases. The mentioned problems and solution methods are sophisticated yet fundamental and fill the gaps that currently exist in the literature. Moreover, the practicality of the defined problems and the solution methods will lead to the efficiency improvement and optimization of the Canadian and international businesses.
Programme
Discovery Grants Program - Individual
Emplacement
Saskatchewan, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
RGPIN-2017-03743
Name nom
Samarghandi, Hamed
Department département
Edwards School of Business - Edwards School of Business
Organization id
16
Institution établissement
University of Saskatchewan
Province en
Saskatchewan
Province fr
Saskatchewan
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2022
Competition year année de concours
2017
Award amount
44000
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
500
Area of application group en
Manufacturing processes and products
Area of application group fr
Procédés et produits industriels
Area of application en
Manufacturing processes and products
Area of application fr
Procédés et produits industriels
Research subject code
1600
Research subject group en
Industrial engineering
Research subject group fr
Génie industriel
Research subject en
Industrial engineering
Research subject fr
Génie industriel
Installment
inst:6;7
Partie
2
Nb partie
7
Application title
Scheduling Optimization of Manufacturing and Service Environments with Time-Lag Constraints
Application summary
The objective of this proposal is to further advance my research program in the realm of the no-wait and time-lag scheduling optimization. No-wait constraints denote that there should be no waiting time between consecutive operations of a job, which is a fundamental assumption in certain environments. Scheduling problems with time-lag constraints are a generalization of their no-wait version. Time-lag constraints force the jobs or the operations of the jobs to start or finish within a certain time window after the previous jobs or operations are completed. No-wait and time-lag constraints model situations in which a long delay between the starting time of an operation and the finish time of the previous operations is discouraged because it may damage or deteriorate the product. For example, in the food industry, many of the production procedures involve perishable products, i.e., once the food is prepared and cooked, it must undergo the chilling process before a certain amount of time is elapsed or it must be discarded. Similar constraints are in place in industries in which the risk of product contamination must be reduced. One can list biotechnology industries, for example, blood transfusion as such fields. Automated medical laboratories usually use a combination of minimal and maximal time-lags to schedule the chemical reactions correctly. Hall and Sriskandarajah [16] and Deppner [17] provide a comprehensive review of the applications of the problem.The proper objective functions to consider include minimizing the cost of production or the total processing time of the contracts in a factory; reducing the waiting time of the patients in a healthcare setting or clients in a government office. Another possibility is maximizing the utilization of the available resources. The mentioned problems are NP-hard. My research in this area during the past few years reveals that to solve the no-wait or time-lag scheduling problems to optimality using mathematical programming models, the problem instance should have less than 20 jobs. The proposed solution methods in this application progress the available literature by applying novel approaches to the scheduling problems that I have been studying for the past eight years. These methods include finding tight upper- or lower bounds for the optimal solution using semidefinite programming or Lagrangian relaxation; using decomposition techniques such as Bender's method; and conducting stochastic optimization techniques to the non-deterministic cases. The mentioned problems and solution methods are sophisticated yet fundamental and fill the gaps that currently exist in the literature. Moreover, the practicality of the defined problems and the solution methods will lead to the efficiency improvement and optimization of the Canadian and international businesses.