Author:
Bouzina Khalid I.,Emmons Hamilton
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Management Science and Operations Research,Control and Optimization,Computer Science Applications
Reference9 articles.
1. Arkin, A.M. and Silverberg, E.L. (1987), Scheduling Jobs with Fixed Start and End Times, Discrete Applied Mathematics, 18, 1?8.
2. Carter, M.W. and Tovey, C.A. (1992), When is the Classroom Assignment Problem Hard? Operations Research, 40, Suppl. No 1, 28?39.
3. Dondeti, V.R. and Emmons, H. (1992). Fixed job Scheduling with Two types of Processors, Operations Research, 40, Supp. No 1, 76?85.
4. Fischetti, M., Martello, S. and Toth, P. (1989), The Fixed Job Schedule Problem with Working Time Constraints, Operations Research, 3, 395?403.
5. Garey, M.R. and Johnson, D.S. (1979), Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco.
Cited by
59 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献