| 1 |
Graham R , Lawler E , Lenstra J , et al. Optimization and approximation in deterministic sequencing and scheduling: A survey[J]. Annals of Discrete Mathematics, 1979, 5, 287- 326.
|
| 2 |
Bertsimas D , Farias V F , Trichakis N . The price of fairness[J]. Operations Research, 2011, 59 (1): 17- 31.
doi: 10.1287/opre.1100.0865
|
| 3 |
Garey M R , Johnson D S . Computers and Intractability: A Guide to the Theory of NP-Completeness[M]. New York: Freeman, 1978.
|
| 4 |
Horn W A . Minimizing average flow time with parallel machines[J]. Operations Research, 1973, 21 (3): 846- 847.
doi: 10.1287/opre.21.3.846
|
| 5 |
Bruno J , Coffman Jr E G , Sethi R . Scheduling independent tasks to reduce mean finishing time[J]. Communications of the ACM, 1974, 17 (7): 382- 387.
doi: 10.1145/361011.361064
|
| 6 |
Horowitz E , Sahni S . Exact and approximate algorithms for scheduling nonidentical processors[J]. Journal of the ACM, 1976, 23 (2): 317- 327.
doi: 10.1145/321941.321951
|
| 7 |
Conway R W , Maxwell W L , Miller LW . Theory of Scheduling[M]. Boston: Addison-Wesley, 1967.
|
| 8 |
Immorlica N , Li L , Mirrokni V S , et al. Coordination mechanisms for selfish scheduling[J]. Theoretical Computer Science, 2009, 410, 1589- 1598.
doi: 10.1016/j.tcs.2008.12.032
|
| 9 |
Koutsoupias E , Papadimitriou C H . Worst-case equilibria[J]. Computer Science Review, 2009, 3, 65- 69.
doi: 10.1016/j.cosrev.2009.04.003
|
| 10 |
Hoeksma R , Uetz M . The price of anarchy for utilitarian scheduling games on related machines[J]. Discrete Optimization, 2019, 31, 29- 39.
doi: 10.1016/j.disopt.2018.08.001
|
| 11 |
Lee K , Leung J Y T , Pinedo M L . Coordination mechanisms for parallel machine scheduling[J]. European Journal of Operational Research, 2012, 220 (2): 305- 313.
doi: 10.1016/j.ejor.2012.02.001
|
| 12 |
Zhang L , Zhang Y , Du D , et al. Improved price of anarchy for machine scheduling games with coordination mechanisms[J]. Optimization Letters, 2019, 13 (4): 949- 959.
doi: 10.1007/s11590-018-1285-3
|
| 13 |
Hoeksma R. Price of anarchy for machine scheduling games with sum of completion times objective[D]. Enschede: University of Twente, 2010.
|
| 14 |
Yan Y J. Scheduling problems with utilitarian objective and related problems[D]. Hangzhou: Zhejiang University, 2017.
|
| 15 |
Epstein L , Noga J , Seiden S , et al. Randomized on-line scheduling on two uniform machines[J]. Journal of Scheduling, 2001, 4, 71- 92.
|
| 16 |
Mireault P , Orlin J B , Vohra R V . A parametric worst case analysis of the LPT heuristic for two uniform machines[J]. Operations Research, 1997, 45 (1): 116- 125.
|
), Yujie YAN1
