1. AHO A V HOPCROFT J E AND ULLMAN J D The Deszgn and Analysis of Computer Algorithms. Addison- Wesley Reading Mass 1974 AHO A V HOPCROFT J E AND ULLMAN J D The Deszgn and Analysis of Computer Algorithms. Addison- Wesley Reading Mass 1974
2. Optunal scheduling for two-processor systems;COFFMAN E G;Acta Informat~ca,1972
3. Discrete variable extremum problems;DANTZIG G B;Oper Res,1957
4. GAREY M R AND JOHNSON D S Complexity results for mulUprocessor scheduling under resource constraints SIAM J Comptng. 4 (1975) 397-41 l GAREY M R AND JOHNSON D S Complexity results for mulUprocessor scheduling under resource constraints SIAM J Comptng. 4 (1975) 397-41 l
5. Two processor scheduhng wtth start ttmes and deadlines SlAM J;GAREY M R;Comptng,1977