1. Lohtka, P., Private Communication, 1989.
2. Hehner, B.,Making It: The Business of Film and Television in Canada, Academy of Canadian Cinema and Television, Ottawa, Canada, 1987.
3. Garey, M. R., Johnson, D. S., andStockmeyer, L.,Some Simplified NP-Complete Graph Problems, Theoretical Computer Science, Vol. 1, pp. 237?267, 1976.
4. Garey, M. R., andJohnson, D. S.,Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, New York, New York, 1979.
5. French, S.,Sequencing and Scheduling: An Introduction to the Mathematics of Job Shop, John Wiley and Sons, New York, New York, 1982.