Date of Award
Industrial and Manufacturing Systems Engineering
CC BY-NC-ND 4.0
In this thesis, a heuristic procedure to find the average waiting time for multi-item single machine is presented. The heuristic is based on the assumption that the ratio of run time to setup time is constant across all items. The heuristic is tested against two nonlinear optimizers (MINOS and Simulating Annealing) and for all the tests the average waiting times for the Heuristic are very close to the values given by both Optimizers and this shows that the Heuristic is a good one. The second part of this research is a cost model for the multi-item multi-machine where the problem is converted to multi-item single machine by equally allocating the workload across all the machines. A procedure to allocate items to machines is developed and a solution method to find the number of machines in order to minimize the sum of machinery cost, maintenance cost and delay cost.Dept. of Industrial and Manufacturing Systems Engineering. Paper copy at Leddy Library: Theses & Major Papers - Basement, West Bldg. / Call Number: Thesis1993 .H353. Source: Masters Abstracts International, Volume: 32-06, page: 1691. Adviser: S. Taboun. Thesis (M.A.Sc.)--University of Windsor (Canada), 1993.
Halleb, Hamda., "Batching for multi-item single-machine and multi-item multi-machine." (1993). Electronic Theses and Dissertations. 1271.