1. Scheduling the openshop to minimize mean flow time;Achugbue;SIAM Journal on Computing,1982
2. Network Flows—Theory, Algorithms, and Applications;Ahuja,1993
3. Two parallel machine sequencing problems involving controllable job processing times;Alidaee;European Journal of Operational Research,1993
4. A note on minimizing the weighted sum of tardy and early completion penalties in a single machine: A case of small common due date;Alidaee;European Journal of Operational Research,1997
5. Aslam, J.A., Rasala, A., Stein, C., Young, N., 1999. Improved bicriteria existence theorems for scheduling. In: Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms, pp. 846–847