The rule-based approach is one of the most commonly used approaches in FMS scheduling problems. In this paper, the literature is classified into two paradigms - the global-queue paradigm and the machine-queue paradigm. Experiments for comparison of these two paradigms are given, which show the need of a suitable routing rule for the machine-queue paradigm. A routing rule is proposed here with the meet-due-date rate as the objective. With this rule, both paradigms show the advantages in certain cases. An idea to exploit the paradigms by hybridization is then proposed. The performance of the proposed rule and hybrid paradigm is verified through a comprehensive simulation study.
展开▼
