| Summary: | 碩士 === 國立東華大學 === 應用數學系 === 99 === Re-entrant networks resemble many important manufacturing systems, such as semi-conductor industry, for example, that are highly capital intensified. Hence, the study on finding the scheduling policy with the largest throughput rate for this type of systems has received great attention, and can be found in many research papers in the literature. However, due to the complexity of this queueing model, there are still many open questions remained unsolved. In this thesis, we consider a special class of re-entrant models, a closed cyclic re-entrant network, that is both simple and basic. We study a few popular scheduling policies, such as first-buffer-first-serve, last-buffer-last-serve, and workload balancing policies, and compare their performance for various re-entrant networks in the class.
|
|---|
