1. J. Aslam, A. Rasala, C. Stein, N. Young, Improved bicriteria existence theorems for scheduling, in: Proceedings 10th Annual ACM-SIAM Symposium on Discrete Algorithms, 1999, pp. 846–847.
2. C.H. Papadimitriou, M. Yannakakis, On the approximability of trade-offs and optimal access of web sources, in: Proceedings 41st Annual Symposium on Foundations of Computer Science, pp. 86–92.
3. A. Rasala, C. Stein, E. Torng, P. Uthaisombut, Existence theorems, lower bounds and algorithms for scheduling to meet two objectives, in: Proceedings 13th Annual ACM-SIAM Symposium on Discrete Algorithms, 2002, pp. 723–731.
4. Various optimizers for single-stage production;Smith;Nav. Res. Logistic Q.,1956
5. On the existence of schedules that are near-optimal for both makespan and total weighted completion time;Stein;Oper. Res. Lett.,1997