期刊名称：Journal of Computing and Information Technology
印刷版ISSN：1330-1136
电子版ISSN：1846-3908
出版年度：1997
卷号：5
期号：4
页码：231-238
语种：English
出版社：SRCE - Sveučilišni računski centar
摘要：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 from one type to another requires different setup times. A better upper bound on the total work backlog than those available in literature is derived by introducing the clear-the-largest-work-after- setup (CLWS) heuristic policy which stabilizes the system in the sense that, in the long run, the required demand is met. Studying whether the CLWS scheduling policy induces convergence to a stationary state, some precedence relations between part types are reported with the computational results.
