Improved Communication Schedules with Buffers {\it Parallel Processing Letters,} Vol 19, No. 1, 129 -- 139, 2009.

Scheduling Independent Tasks to Minimize Computation and Communication Makespan in Distributed Systems, Proceedings of the 20th IASTED International Conference on Parallel and Distributed Computing and Systems PDCS '08.

Minimizing Total Completion Time on Uniform Processor Systems with Deadline Constraints, (with J. Leung and M. Pinedo), ACM Transactions on Algorithms, Vol. 2, No. 1, pp. 95 - 115, 2006.

Open Shop Scheduling," in Handbook of Scheduling: Algorithms, Models, and Performance Analysis, Ed. Y. J.-T. Leung, Chapter 6, Part II, Chapman & Hall / CRC, 2004.

On Solving Multimessage Multicasting Problems, International Journal of Foundations of Computer Science, Special Issue on Scheduling - Theory and Applications, Vol. 12, No. 6, pp. 791 -- 808, 2001.

MultiMessage Multicasting: Complexity and Approximations, Proceedings of the 30th Hawaii International Conference on System Sciences (HICSS), (1997), vol.1, pp. 211 -- 220, Nominated for the Best Paper Award in the Software Technology Track.

Optimal Preemptive Scheduling of Two Unrelated Processors, (with E. L. Lawler and S. Sahni), ORSA Journal on Computing, Vol. 2, No. 3, 1990, pp. 219 -- 224.

Unit Execution Time Shop Problems, Mathematics of Operations Research, Vol. 7, No. 1, February 1982, pp. 57 -- 66.

Preemptive Scheduling of Parallel Processors, ORSA/TIMS Joint National Meeting, Houston Texas, October 1981.

A New Algorithm for Preemptive Scheduling Trees, (with D. B. Johnson), Journal of the Association for Computing Machinery, Vol. 27, No. 2, April 1980, pp. 287 -- 312.

A Note on Open Shop Preemptive Schedules, IEEE Transactions on Computers, Vol. C--28, No. 10, October 1979, pp. 782 -- 786.

NP--hard Shop Problems, Technical Report CS--79--35, The Pennsylvania State University, May 1979, (proofs of theorems in ``Unit Execution Time Shop Problems'' appear in this paper).

Minimizing the Average Flow Time on Open Shops, XXIV International Meeting of the Institute of Management Science, Honolulu, Hawaii, June 1979.

Minimizing the Mean and Maximum Finishing Time on Identical Processors, Technical Report CS--78--13, The Pennsylvania State University, August 1978.

Minimizing the Mean and Maximum Finishing Time on Uniform Processors, Technical Report CS--78--22, The Pennsylvania State University, November 1978.

Flowshop and Jobshop Schedules: Complexity and Approximation, (with S. Sahni), Operations Research, Vol. 26, No. 1, January--February 1978, pp. 36 -- 52.

Preemptive Scheduling of Uniform Processor Systems, (with S. Sahni) Journal of the Association for Computing Machinery, Vol. 25, No. 1, January 1978, pp. 92 -- 101.

Bounds for LPT Schedules for Uniform Processors, (with O. H. Ibarra and S. Sahni), SIAM Journal on Computing, Vol. 6, No. 1, March 1977, pp. 155 -- 166.

Open Shop Scheduling to Minimize Finish Time, (with S. Sahni), Journal of the Association for Computing Machinery, Vol. 23, No. 4, October 1976, pp. 665 -- 679.

P--Complete Approximation Problems, (with S. Sahni), Journal of the Association for Computing Machinery, Vol. 23, No. 3, July 1976, pp. 555 -- 565.

Scheduling Independent Tasks with Release Dates and Due Dates on Parallel Machines, (with J. L. Bruno), Technical Report 213, The Pennsylvania State University, December 1976.

On Flowshop and Jobshop Schedules, (with S. Sahni), ORSA/TIMS Special Interest Conference on Scheduling, Orlando Florida, February 1976.

P--Complete Problems and Approximate Solutions, (with S. Sahni), Proceedings of the 15th Annual IEEE Symposium on Switching and Automata Theory, October 1974, pp. 28 -- 32.