Publisher
Springer Science and Business Media LLC
Reference6 articles.
1. Bachman A., Janiak A.: Scheduling jobs with position dependent processing times. J. Oper. Res. Soc. 55, 257–264 (2004)
2. Farhi B., Kane D.: New results on the least common multiple of consecutive integers. P. Am. Math. Soc. 137, 1933–1939 (2009)
3. Garey M.R., Johnson D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)
4. Hardy G.H., Wright E.M.: An Introduction to the Theory of Numbers. Oxford University Press, New York (1979)
5. Lee C.-Y., Vairaktarkis G.: Complexity of single machine hierarchical scheduling: a survey. In: Pardalos, P.M. (eds) Complexity in Numerical Optimization, pp. 269–298. World Scientific, Singapore (1993)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献