Sequencing Games with Slack Due Windows and Group Technology Considerations
研究了客户初始排序后，通过重新排序节省成本的问题，同时考虑松弛到期窗口和群组技术，提出了两种成本节约分配规则并进行了公理化刻画。
We study sequencing situations in which the customers are initially sequenced to be served by a single server. We consider both slack due windows and group technology simultaneously. We introduce two division rules to divide among the customers the cost saving from resequencing the customers to follow the optimal sequence and characterize the rules axiomatically. Applying cooperative game theory to analyze the sequencing games corresponding to the sequencing situations, we use the theory’s solution concepts to solve the games.