Grant: Engage Grants Program
Concordia University
$25,000.00
Robust multi-objective job-shop scheduling for make-to-order manufacturing
FY 2017-18
Summary
Effective order sequencing and task scheduling has become a necessity for survival in today's competitivemarkets. Scheduling in a manufacturing environment concerns with translating released orders into jobs withassociated due dates and allocating them to designated workstations. Job-shop scheduling is a multi-objectivecombinatorial optimization problem. Nonetheless, the majority of scheduling algorithms are usually efficientunder a given objective function rather than a combination of them. Furthermore, unforeseen events on theshop floor, such as machine break-downs along with rush/canceled orders may have a significant impact on theschedule. In order to reduce the need for major changes in the initial schedule, robustness criteria should beincorporated into scheduling models.In this project, the applicant will team up with Festo Didactic Ltd. in order to overcome the challenges thecompany has been recently confronted in scheduling the continuously increasing sales. The main goal is todevelop a library of algorithmic procedures for robust multi-objective job-shop scheduling. The first steptowards achieving this goal would be the characterization of the specific scheduling problem via investigationof manufacturing processes corresponding to different product families. Identification of variousdecision-making criteria with corresponding priorities in addition to the most pertinent sources of disruptionswill be also an essential step in the project. The new scheduling engine that is expected to be integrated intotheir current production planning software will incorporate a set of basic and composite dispatching rules alongwith local search and metaheuristic algorithms to generate alternative schedules. Developing a discrete-eventsimulation model for the purpose of assessing the performance of generated schedules would be also within therealm of this research project.The results of this project will provide essential benefits to the company in terms of manufacturing lead-timeand work-in-process inventory reduction. Furthermore, the developed scheduling engine can be incorporated
Program
Engage Grants Program
Recipient
Location
Quebec, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
521778-2017
Name nom
KazemiZanjani, Masoumeh
Department département
Mechanical and Industrial Engineering
Organization id
70
Institution établissement
Concordia University
Province en
Québec
Province fr
Québec
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2017
Competition year année de concours
2017
Award amount
25000
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
1552
Committee name en
Quebec Internal Decision Committee
Committee name fr
Comité de décision interne pour le Québec
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
1606
Research subject group en
Industrial engineering
Research subject group fr
Génie industriel
Research subject en
Operations management
Research subject fr
Gestion de la production
Partie
1
Nb partie
1
Application title
Robust multi-objective job-shop scheduling for make-to-order manufacturing
Keyword
NSERC
Application summary
Effective order sequencing and task scheduling has become a necessity for survival in today's competitivemarkets. Scheduling in a manufacturing environment concerns with translating released orders into jobs withassociated due dates and allocating them to designated workstations. Job-shop scheduling is a multi-objectivecombinatorial optimization problem. Nonetheless, the majority of scheduling algorithms are usually efficientunder a given objective function rather than a combination of them. Furthermore, unforeseen events on theshop floor, such as machine break-downs along with rush/canceled orders may have a significant impact on theschedule. In order to reduce the need for major changes in the initial schedule, robustness criteria should beincorporated into scheduling models.In this project, the applicant will team up with Festo Didactic Ltd. in order to overcome the challenges thecompany has been recently confronted in scheduling the continuously increasing sales. The main goal is todevelop a library of algorithmic procedures for robust multi-objective job-shop scheduling. The first steptowards achieving this goal would be the characterization of the specific scheduling problem via investigationof manufacturing processes corresponding to different product families. Identification of variousdecision-making criteria with corresponding priorities in addition to the most pertinent sources of disruptionswill be also an essential step in the project. The new scheduling engine that is expected to be integrated intotheir current production planning software will incorporate a set of basic and composite dispatching rules alongwith local search and metaheuristic algorithms to generate alternative schedules. Developing a discrete-eventsimulation model for the purpose of assessing the performance of generated schedules would be also within therealm of this research project.The results of this project will provide essential benefits to the company in terms of manufacturing lead-timeand work-in-process inventory reduction. Furthermore, the developed scheduling engine can be incorporated