engleski

Some computational results for a class of real time scheduling policies

A model for real time control of flexible manufacturing systems is considered. In this model, a machine can process a finite number of part types at specified rates, but only one part type can be processed at any given time. Each switch form one type to another requires different setup times for different types of parts. Introducing the clear-the-largest-work-after-setup (CWLS) scheduling policy, the system is stabilized in the sense that, in the long run, the required demand is met. Some theorems that are studying the behavier of the CLWS policy are reported and used in comparing the policy to the other policies available in the literature. The suggested policy is tested on some computational examples where the dates are randomply chosen. The results indicate that the CWLS policy induces the convergence to a stationary state (that is, in the long run, the part types are processed periodicaly with a constant period).

Flexible manufacturing systems; real time control; CLWS policy

nije evidentirano