1. , , “ A review of machine scheduling: Complexity, algorithms and approximability”, Handbook of Combinatorial Optimization, (Editors), Kluwer, 1998, pp. 21–169.
2. , Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, 1979.
3. Scheduling unit length jobs with parallel nested machine processing set restrictions
4. Bounds for Certain Multiprocessing Anomalies