In recent years a number of models involving different compatibilities between jobs and servers in queueing systems, or between agents and resources in matching systems, have been studied, and, under Markov assumptions and appropriate stability conditions, the stationary distributions have been shown to have product forms. We survey these results and show how, under an appropriate detailed description of the state, many are corollaries of similar results for the Order Independent Queue. We also discuss how to use the product form results to determine distributions for steady-state response times.

中文翻译：

---

具有任意服务器作业兼容性的 FCFS 排队模型的产品形式：概述

近年来，已经研究了许多涉及排队系统中作业和服务器之间或匹配系统中代理和资源之间不同兼容性的模型，并且在马尔可夫假设和适当的稳定性条件下，平稳分布已被证明具有乘积形式。我们调查了这些结果，并展示了在对状态进行适当详细描述的情况下，许多结果是顺序无关队列的类似结果的必然结果。我们还讨论了如何使用乘积形式的结果来确定稳态响应时间的分布。