Many times agents have to realize several jobs. However, only one job can be processed by one agent in the same time. The problem when and how to assign the jobs to agents is solved in this paper. Both agents and jobs are modelled by place/transition Petri nets (P/T PN). The task of assigning the jobs to an agent is understood to be a task of the jobs cooperation. To coordinate the jobs a supervisor is synthesized. The supervisor forces a desired job cooperation strategy to utilize the agent manufacturing capacity as exhaustively as possible. The supervisor synthesis is based on discrete-event systems (DES) control theory and performed by means of P/T PN. In case of assigning several jobs to the agent(s) it is necessary to force the job priorities. The P/T PN firing count vector (Parikh's vector) is utilized here to ensure the desired priorities. Then, the time parameter is added to the final P/T PN structure. In such a way timed PN (TPN) arises. It allows to analyze the time circumstances. Namely, processing of each job by the agent takes some time.
展开▼
机译：很多时候，代理商必须完成几项工作。但是，一个代理只能同时处理一项作业。解决了何时以及如何将工作分配给座席的问题。座席和工作均由位置/过渡Petri网（P / T PN）建模。将工作分配给代理的任务被理解为工作合作的任务。为了协调工作，主管是综合人员。主管强制执行所需的工作合作策略，以尽可能全面地利用代理商的生产能力。主管综合基于离散事件系统（DES）控制理论，并通过P / T PN进行。在向代理分配多个作业的情况下，有必要强制执行作业优先级。 P / T PN触发计数向量（Parikh向量）在此处用于确保所需的优先级。然后，将时间参数添加到最终的P / T PN结构中。以这种方式，出现了定时PN（TPN）。它允许分析时间情况。即，代理对每个作业的处理要花费一些时间。
展开▼
