Date of Award
Industrial and Manufacturing Systems Engineering
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.
Assembly plays an important role in modern industry. Flexible Assembly Systems (FAS), as a new, promising production technology, can provide high productivity and flexibility. The research efforts made on FAS problems are insufficient, especially on the loading problem. This research investigates the loading problem in FAS by means of 0-1 integer programming modelling. Model 1 is formulated to assign operations to work stations so as to minimize the total processing cost. Important assembly realities such as different component sizes, component mating, operation precedence, station workload balance and different work station characteristics are considered. Model 2 is proposed to deal with the system with large number of work stations. The workload unbalance among work stations is considered as a penalty in the objective function in Model 2 in order to reduce problem size. Some examples are solved using these models for computational experience and also to reflect the utility of these models. The effects of workload balance are investigated. Sensitivity analyses of total available time and component feeder capacity are carried out. The effects of the weight of the penalty term in Model 2 are also investigated. Some important issues related to this study are discussed such as the total cost of system, total available time, cycle time and work station reliability. The comparison of the two proposed models are given.Dept. of Industrial and Manufacturing Systems Engineering. Paper copy at Leddy Library: Theses & Major Papers - Basement, West Bldg. / Call Number: Thesis1992 .D935. Source: Masters Abstracts International, Volume: 31-04, page: 1902. Thesis (M.A.Sc.)--University of Windsor (Canada), 1992.
Duan, Xiaomei., "Mathematical modelling of loading problem in flexible assembly systems." (1992). Electronic Theses and Dissertations. 2678.