代价依赖于加工位置的单机排序情形

Single Machine Sequencing Situations with Position-Based Costs

对于客户代价依赖于加工位置而非整个工序的单机排序情形,每个客户在不同位置上的代价可以由一个代价矩阵来描述。给定一个排序情形,一个可行解包括最终采用的工序和相应的客户代价支付方案。本文研究最优工序下的客户代价支付方案,给出了有初始工序时的一个分配规则,以及无初始工序时通过指派博弈得到的支付方案。

In this paper, we discuss single machine sequencing situations with position-based costs. For these sequencing situations, the costs of agents on different positions are given by a matrix. Solving a sequencing situation means choosing a final processing order and deciding the related payment scheme. We focus on the payment scheme under the optimal processing order. When there is an initial order we design a simple cost allocation rule, and without initial order we make the payment scheme by an assignment game.