华中科技大学学报（自然科学版）2025，Vol.53Issue(10)：22-28,7.DOI:10.13245/j.hust.251096
带两个服务等级的m台同型机排序博弈问题
Identical scheduling game problem of m machines with two hierarchies
摘要
Abstract
With the rapid economic development,traditional scheduling theory is no longer suitable for current practical needs.Assuming that jobs in the scheduling problem model had a certain degree of independence and selfishness and pursue their own interests to maxmize,game theory with the scheduling problem was combined to form a scheduling game problem.The scheduling game problem of m identical machines with two service hierarchies was studied,the coordination mechanisms LG-LPT(low priority for lower hierarchy,longer processing time for the same hierarchy)and LG-SPT(low priority for lower hierarchy,shorter processing time for the same hierarchy)were discussed,as well as the values of the price of anarchy and the price of stability when the two mechanisms were mixed.Results show that when the hierarchy of jobs and machines is 1 or 2,jobs can only be processed on machines when the job hierarchy is greater than or equal to the machine hierarchy.Defining the cost of the job as its completion time and the social cost as the makespan,so that the social cost was minimized,through instances,the lower bound of price of stability was given.Combining the properties of Nash equilibrium,the relationship between the processing time of the job that determined the makespan and the machine load was analyzed,and the upper bound of price of anarchy was given.关键词
排序博弈/服务等级/协调机制/无政府代价/稳定代价Key words
scheduling game/hierarchy/coordination mechanisms/price of anarchy/price of stability分类
数理科学引用本文复制引用
关莉,刘欣..带两个服务等级的m台同型机排序博弈问题[J].华中科技大学学报（自然科学版）,2025,53(10):22-28,7.基金项目
国家自然科学基金资助项目(12071417) （12071417）
云南大学研究生科研创新基金资助项目. （）
