Author:
Goldengorin Boris,Romanuke Vadim
Funder
Ministry of Education and Science of the Russian Federation
Subject
General Engineering,General Computer Science
Reference16 articles.
1. Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time;Batsyn;Optimization Methods & Software,2014
2. Batsyn, M., Goldengorin, B., Sukhov, P., & Pardalos, P. (2013). Lower and Upper Bounds for the Preemptive Single Machine Scheduling Problem with Equal Processing Times. In B. Goldengorin, V. Kalyagin, & P. Pardalos (Eds.), Models, algorithms, and technologies for network analysis. Springer proceedings in mathematics & statistics (vol. 59, pp. 11–27). Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8588-9_2.
3. Minimizing total tardiness on one machine is NP-hard;Du;Mathematics of Operations Research,1990
4. Computers and intractability: A guide to the theory of NP-completeness;Garey,1979
5. A correcting algorithm for solving some discrete optimization problems;Goldengorin;Dokl. Akad. Nauk SSSR,1983
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献