HEURISTIC APPROACHES FOR LOADING PROBLEMS IN FLEXIBLE MANUFACTURING SYSTEMS

Abstract

Flexible manufacturing systems (FMSs) are able to process a wide variety of operations, but the specific mix of operations that can be performed at any point in time depends upon the combination of tools loaded onto the machine. The machine have tool magazines with finite capacities. We consider the problem of assigning operations and their associated tools to machines (or groups of machines) to maximize the throughput for a specified steady-state mix of orders. Since this objective is difficult to deal with directly, we use an intermediate objective of meeting workload targets for each machine group as closely as possible. A certain form of this intermediate objective has been shown to correlate highly with the original objective. Since it is computationally intractable to find optimal solutions for problems with more than 20 operations, fast heuristic algorithms are developed. These algorithms are adapted from multi-dimensional bin-packing algorithms. Computational results are reported.