Reference number : GC-2017-Q1-00554, amendment number : , agreement type : G, recipient legal name : Defersha, Fantahun (University of Guelph), recipient country : CA, recipient province : nan, recipient city : Ontario, recipient postal code : nan, program name english : Engage Plus Grants for Universities, program name french : Subvention d'engagement partenarial Plus pour les universités, program purpose english : Most published articles in scheduling research are focused in developing models and algorithms to theoretical_x000D_
problems having limited applications. The scheduling problem identified in the collaborating company happens_x000D_
to be very different from those know in literature. It involves the scheduling of a large variety of orders with_x000D_
greater operational complexity. Many of the operations on the products are to be processed unit by unit._x000D_
However, most products also need to passes through a batch processing facility with apparent complexity to_x000D_
incorporate in a scheduling model. Moreover, products need both machining and assembly operations where_x000D_
components and sub-assemblies need to pass through many processing stations. Some of the products have_x000D_
operations that are outsourced and their semi-finished inventory needs to be sent to other facilities and be_x000D_
returned for further in-house processing. Machine operators are limited resources. Many of these operators are_x000D_
cross trained and can be assigned to different types of machines. Operators may also tend more than one_x000D_
machine at a time. Hence their task need to be scheduled in details along the operations. Critical segments of_x000D_
the manufacturing facility are operated multiple shift or overtime while the rest are operated only a single shift._x000D_
These unique combination of problem features makes scheduling very difficult. Hence, the company faces a_x000D_
challenge in running its operations smoothly with minimal work-in-process inventory while at the same time_x000D_
meeting product delivery dates. A preliminary study was conducted to develop an efficient scheduling_x000D_
technique based on Event Scheduling/Time Advance (ESTA) algorithm. The approach proves to be capable of_x000D_
handling many of the operational logic of the manufacturing facility and generate schedules for the machines_x000D_
and the operators, and optimize several performance criteria. This research is a continuation of this_x000D_
achievement and is aimed at enhancing the developed algorithm to incorporate several details of the_x000D_
manufacturing system. Moreover, a limited study will be conducted for integrating production scheduling with_x000D_
other operational issues such as inventory management and maintenance planning., program purpose french : Most published articles in scheduling research are focused in developing models and algorithms to theoretical_x000D_
problems having limited applications. The scheduling problem identified in the collaborating company happens_x000D_
to be very different from those know in literature. It involves the scheduling of a large variety of orders with_x000D_
greater operational complexity. Many of the operations on the products are to be processed unit by unit._x000D_
However, most products also need to passes through a batch processing facility with apparent complexity to_x000D_
incorporate in a scheduling model. Moreover, products need both machining and assembly operations where_x000D_
components and sub-assemblies need to pass through many processing stations. Some of the products have_x000D_
operations that are outsourced and their semi-finished inventory needs to be sent to other facilities and be_x000D_
returned for further in-house processing. Machine operators are limited resources. Many of these operators are_x000D_
cross trained and can be assigned to different types of machines. Operators may also tend more than one_x000D_
machine at a time. Hence their task need to be scheduled in details along the operations. Critical segments of_x000D_
the manufacturing facility are operated multiple shift or overtime while the rest are operated only a single shift._x000D_
These unique combination of problem features makes scheduling very difficult. Hence, the company faces a_x000D_
challenge in running its operations smoothly with minimal work-in-process inventory while at the same time_x000D_
meeting product delivery dates. A preliminary study was conducted to develop an efficient scheduling_x000D_
technique based on Event Scheduling/Time Advance (ESTA) algorithm. The approach proves to be capable of_x000D_
handling many of the operational logic of the manufacturing facility and generate schedules for the machines_x000D_
and the operators, and optimize several performance criteria. This research is a continuation of this_x000D_
achievement and is aimed at enhancing the developed algorithm to incorporate several details of the_x000D_
manufacturing system. Moreover, a limited study will be conducted for integrating production scheduling with_x000D_
other operational issues such as inventory management and maintenance planning., agreement title english : Integrated Production and Manpower Scheduling - Second Phase, agreement title french : Integrated Production and Manpower Scheduling - Second Phase, agreement number : EGP2, agreement value : 12498.0, agreement start date : 2017-06-14, agreement end date : nan, description english : nan, description french : nan, expected results english : nan, expected results french : nan, additional information english : Grant or Award spanning more than one fiscal year. (2017-2018 to 2018-2019), additional information french : Subvention ou bourse octroyée s'appliquant à plus d'un exercice financier. (2017-2018 à 2018-2019), owner organization : nserc-crsng, owner organization title : Natural Sciences and Engineering Research Council of Canada | Conseil de recherches en sciences naturelles et en génie du Canada