Article ID: | iaor2017867 |
Volume: | 68 |
Issue: | 2 |
Start Page Number: | 121 |
End Page Number: | 133 |
Publication Date: | Feb 2017 |
Journal: | J Oper Res Soc |
Authors: | Ji Min, Cheng T, Liu Sai, Zhang Xiaolin, Cao Keke |
Keywords: | queues: applications, simulation |
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.