This thesis focuses on a complex cell loading and scheduling problem at a shoe manufacturing facility. A set of four cell loading heuristics, namely – Do Not Split, Split as and when required, and Split Only When Load Greater than MaxCap, were developed and augmented with a simple cell scheduling methodology. The objective of the heuristic procedures is to ensure that all the jobs are loaded without exceeding the given capacity. The heuristics can also be used to minimize makespan by carefully defining certain parameters. The heuristics are encoded using VB 6.0 and a software application was created to test and compare the heuristics. These heuristics are compared with respect to completed jobs, makespan and setup times. Overall, after the cell loading stage, the Split as and when required heuristic can recommended as the best. But the optimal result from the cell loading stage might not be so at the end of the cell scheduling stage. The choice of heuristics is also driven by the conditions that the user is faced with like overtime costs, machine breakdowns etc. Hence the heuristics have to be repeatedly applied after varying inputs until an optimal result appears at the end of the scheduling stage. However this is not a tedious process given the processing speed of the software application.