Author:
Lu Lingfa,Zhang Liqi,Ou Jinwen
Publisher
Springer International Publishing
Reference22 articles.
1. Bartal, Y., Leonardi, S., Spaccamela, A.M., Stougie, J.: Multi-processor scheduling with rejection. SIAM J. Discret. Math. 13, 64–78 (2000)
2. Chai, X., Lu, L.F., Li, W.H., Zhang, L.Q.: Best-possible online algorithms for single machine scheduling to minimize the maximum weighted completion time. Asia-Pacific J. Oper. Res. 35, 1850048 (2018)
3. Chen, R.-X., Li, S.-S.: Minimizing maximum delivery completion time for order scheduling with rejection. J. Comb. Optim. 40(4), 1044–1064 (2020). https://doi.org/10.1007/s10878-020-00649-2
4. Feng, Q., Yuan, J.J.: NP-hardness of a multicriteria scheduling on two families of jobs. OR Trans. 11, 121–126 (2007)
5. Garey, M.R., Johnson, D.S.: Computers and Intractablity: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA (1979)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献