An inexact algorithm for part input sequencing and scheduling with side constraints in FMS

Consider a flexible manufacturing system that produces parts of several types. The FMS consists of several groups of pooled, identical machines, a materials handling system, and a set of nonconsumable resources. Each type of part has its own unique sequence in the execution of the operations. An inexact algorithm is presented that sequences and schedules the input of the parts in the FMS by considering constraints such as machine availabilities and other resources in the machine groups, the availability of the transport units, and so on. Primarily, the goal of the algorithm is to minimize makespan and, secondarily, to minimize turnaround time. Several strategies are discussed, and the results are reported. A real-life problem is described.