Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,General Decision Sciences
Reference35 articles.
1. Adamu, M. O., & Adewumi, A. O. (2014). A survey of single machine scheduling to minimize wieighted number of tardy jobs. Journal of Industrial and Management Optimization, 10(1), 219–241.
2. Baptiste, P. (1999). An O$$(n^4)$$ algorithm for preemptive scheduling of a single machine to minimize the number of late jobs. Operations Research Letters, 24, 175–180.
3. Batsyn, M., Goldengorin, B., Sukov, P., & Pardalos, P. M. (2013). Models, Algorithms, and technologies for network analysis. In Springer proceedings in mathematics & statistics, chap Lower and upper bounds for the preemptive single machine scheduling problem with equal processing times (vol. 59, pp. 11–27). Springer.
4. Belouadah, H., Posner, M. E., & Chris, C. N. (1992). Scheduling with release dates on a single machine to minimize total weighted completion time. Discrete Applied Mathematics, 36(3), 213–231.
5. Berghman, L., & Spieksma, F. C. R. (2015). Valid inequalities for a time-indexed formulation. Operations Research Letters, 43(3), 268–272.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献