Publisher
Springer International Publishing
Reference23 articles.
1. Bartal, Y., Leonardi, S., Spaccamela, A.M., Stougie, J.: Multi-processor scheduling with rejection. SIAM J. Discrete Math. 13, 64–78 (2000)
2. 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
3. Engels, D.W., Karger, D.R., Kolliopoulos, S.G., Sengupta, S., Uma, R.N., Wein, J.: Techniques for scheduling with rejection. J. Algorithms 49, 175–191 (2003)
4. Epstein, L., Noga, J., Woeginger, G.J.: On-line scheduling of unit time jobs with rejection: minimizing the total completion time. Oper. Res. Lett. 30, 415–420 (2002)
5. Garey, M.R., Johnson, D.S.: Computers and Intractablity: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)