References
- Abramowitz , Milton and Stegun , Irene A. , Handbook of Mathematical Functions , Dover Publications, Inc. , New York ( 1965 ).
- Bratley , Paul , Florian , Michael and Robillard , Pierre , “ Scheduling with Earliest Start and Due Date Constraints on Multiple Machines ,” Naval Research Logistics Quarterly , 221 , 165 – 173 ( March 1975 ).
- Elmaghraby , Salah E. , “ The Sequencing of n Jobs on m Parallel Processors with Extensions to the Scarce Resources Problem of Activity Networks ,” Proceedings of the Inaugural Conference , Scientific Computation Center , Cairo , Egypt ( 1969 ).
- Hardy , G. H. , Littlewood , J. E. and Polya , G. , Inequalities , Cambridge University Press , New York ( 1952 ).
- Horn , W. A. , “ Some Simple Scheduling Algorithms ,” Naval Research Logistics Quarterly , 211 , 177 – 185 ( March 1974 ).
- Jackson , J. R. , “ Scheduling on a Production Line to Minimize Maximum Tardiness ,” Research Report No. 43, Management Sciences Research Project, University of California at Los Angeles, ( January 1955 ).
- Karp , Richard M. , “ Reducibility Among Combinatorial Algorithms ,” Symposium on the Complexity of Computer Computation , Plenum Press , New York , pp. 85 – 104 ( 1972 ).
- Nunnikhoven , Thomas S. , “ Scheduling Independent Jobs on Parallel Machines to Minimize Two Objectives Related to Job Tardiness ,” PhD Dissertation, Case Western Reserve University , Cleveland , Ohio ( 1975 ).
- Rothkopf , Michael H. , “ Scheduling Independent Tasks on Parallel Processors ,” Management Science , 126 , 437 – 447 ( January 1966 ).
- Wilkerson , L. and Irwin , J. , “ An Improved Algorithm for Scheduling Independent Tasks ,” Technical Report AU-t-15 , Digital Systems Laboratory, Auburn University , Auburn , Alabama ( August 1970 ).