Canada Spends Logo

Explore our Budget 2026 analysis

Grant: Engage Grants Program

University of Guelph

$21,000.00

Solving non-conventional scheduling problem in a complex automated paint line

FY 2013-14

Summary
Manufacturing systems scheduling has continued to be a very active field in the operations research communityfor so many years. Most published articles are focused in developing models and algorithms for conventionalscheduling problems having well-defined structures such as those found in jobshop, flowshop, parallel machineshop and their variants. However, the vast majority of algorithms appeared in literature are of limited use tocompanies with specific problems. Real-world scheduling problems are extremely different from researchproblems and quite often they are very complicated. Thus, highly focused and specialized research endeavorsare very timely and much needed in solving these non-conventional scheduling problems. The schedulingproblem identified in the collaborating industry is typical example of such difficult problems. The probleminvolves optimizing the placement of different components with varying styles and color in a complex paintingand assembly facility having a large number of complicated operational constraints. In this research, efficientmeta-heuristic algorithm will be developed to solve such non-conventional scheduling problem. The approachinvolves the encoding of the sequence and number in which the different styles and colors of parts loaded intothe paint line in a solution representation. The solution representation is a structured data-type incorporatingseveral systems constraints. The goodness of the decoded solution will be evaluated using EventScheduling/Time Advance (ESTA) algorithm. The ESTA approach will enable to simulate the dynamic natureof the paint line facility and measure several performance criteria including demand satisfaction, material flowcongestion, work-in-process inventory, space and material-handling equipment utilization among others. Thesolution will then be iteratively improved applying the principle of the selected meta-heuristic algorithm.
Program
Engage Grants Program
Location
Ontario, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data

As published

Application id
453080-2013
Name nom
Defersha, Fantahun
Department département
Engineering, School of
Organization id
24
Institution établissement
University of Guelph
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2013
Competition year année de concours
2013
Award amount
21000
Program id
EGP
Program name en
Engage Grants Program
Program name fr
Programme de subventions d'engagement partenariat
Group en
Research partnerships programs
Group fr
Programmes de partenariat
Committee code
1553
Committee name en
Ontario Internal Decision Committee
Committee name fr
Comité de décision interne pour l'Ontario
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
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
Partie
1
Nb partie
1
Application title
Solving non-conventional scheduling problem in a complex automated paint line
Keyword
NSERC
Application summary
Manufacturing systems scheduling has continued to be a very active field in the operations research communityfor so many years. Most published articles are focused in developing models and algorithms for conventionalscheduling problems having well-defined structures such as those found in jobshop, flowshop, parallel machineshop and their variants. However, the vast majority of algorithms appeared in literature are of limited use tocompanies with specific problems. Real-world scheduling problems are extremely different from researchproblems and quite often they are very complicated. Thus, highly focused and specialized research endeavorsare very timely and much needed in solving these non-conventional scheduling problems. The schedulingproblem identified in the collaborating industry is typical example of such difficult problems. The probleminvolves optimizing the placement of different components with varying styles and color in a complex paintingand assembly facility having a large number of complicated operational constraints. In this research, efficientmeta-heuristic algorithm will be developed to solve such non-conventional scheduling problem. The approachinvolves the encoding of the sequence and number in which the different styles and colors of parts loaded intothe paint line in a solution representation. The solution representation is a structured data-type incorporatingseveral systems constraints. The goodness of the decoded solution will be evaluated using EventScheduling/Time Advance (ESTA) algorithm. The ESTA approach will enable to simulate the dynamic natureof the paint line facility and measure several performance criteria including demand satisfaction, material flowcongestion, work-in-process inventory, space and material-handling equipment utilization among others. Thesolution will then be iteratively improved applying the principle of the selected meta-heuristic algorithm.