Author:
He Yong,Zhong Weiya,Gu Huikun
Subject
General Computer Science,Theoretical Computer Science
Reference8 articles.
1. Single machine flow-time scheduling with a single breakdown;Adiri;Acta Inform.,1989
2. Machine scheduling with job delivery coordination;Chang;European J. Oper. Res.,2004
3. H. Kellerer, U. Pferschy, A New Fully Polynomial Approximation Scheme for the Knapsack Problem, Lecture Notes in Computer Science, Vol. 1444, 1998, 123–134.
4. Fast approximation algorithms for knapsack problems;Lawler;Math. Oper. Res.,1979
5. Single machine flow-time scheduling with scheduled maintance;Lee;Acta Inform.,1992
Cited by
59 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献