Author:
Ng C. T.,Cheng T. C. E.,Yuan J. J.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference7 articles.
1. Agnetis A, Mirchandani PB, Pacciarelli D, Pacifici A (2004) Scheduling problems with two competing agents. Oper Res 52:229–242
2. Clifford JJ, Posner ME (2001) Parallel scheduling with high multiplicity. Mathematical Programming, Ser. A, 89:359–383
3. Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco, CA
4. Hochbaum DS, Shamir R (1991) Strongly polynomial algorithms for the high multiplicity scheduling problem. Oper Res 39:648–653
5. Lawler EL (1977) A pseudopolynomial algorithm for sequencing jobs to minimize total tardiness. Annals Discr Math, 1:331–342
Cited by
129 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献