A global mixed-integer linear programming model for flexible manufacturing system scheduling

Flexible manufacturing systems (FMS) require intelligent scheduling strategies to achieve their principal benefit – combining high flexibility with high productivity. A mixed-integer linear programming (MILP) model is presented here for FMS scheduling. The model takes a global view of the problem and specifically takes into account constraints on storage and transportation. Both of these constrained resources are critical for practical FMS scheduling problems and are difficult to model. The MILP model is explained and justified and its complexity is discussed. Two heuristic procedures are developed, based on an analysis of the global MILP model. Computational results are presented comparing the performance of the different solution strategies. The development of iterative global heuristics based on mathematical programming formulations is advocated for a wide class of FMS scheduling problems.