The modeling of perfect sequencing flexibility in a scheduling environment

The concept of sequencing flexibility and its potential importance in such scheduling environments as those of manufacturing systems is reviewed. The statement of a particular manufacturing problem is provided, requiring that a simulation model be built for use in studying the system performance under conditions of perfect sequencing flexibility when the rule used to dispatch jobs to machines is FRS (fewest remaining steps). A workable approach to modeling perfect sequencing flexibility is then described. Finally, a GPSS/H model illustrating the implementation of this approach in the setting of the stated problem is presented