Subject
Artificial Intelligence,Management Science and Operations Research,General Engineering,Software
Reference31 articles.
1. Computers and Intractability: 5A Guide to the Theory of NP-Completeness. W.H. Freeman and Company: New York, 1979.
2. The job shop scheduling problem: Conventional and new solution techniques
3. Texture measurements as a basis for heuristic commitment techniques in constraint-directed scheduling. PhD Thesis, University of Toronto, 1999.
4. Benchmarks for basic scheduling problems
5. Adjustment of heads and tails for the job-shop problem
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献