References
- BAKER , K. R. , 1974 , hitrodveiion to Sequencing and Scheduling ( J. Wiley & Sons .).
- BAKER , K. R. and Su , Z. , 1974 , Sequencing with due dates and early start times to minimize tardiness . Nuv. Res. Logist. Q. , 21 , 171 ,
- BRATLEY , P. , FL.OR.IAN. M. and ROBILLARD , P. , 1973 , On scheduling with earliest start and due dates with applications to computing bounds for the (n/m/G/fmax) problem . Nan. Res. Logist. Q. , 20 , 57 .
- CONWAY , R. W. , MAXWELL , W. L. ,MJLI. ER , L. VV. , 1907 , Theory of Scheduling ( Addison-Wesley ).
- CORNEJOLS , G. , FISHER , M. L. ,NEMHAUSKR, G. L,, 1977 , Location of bank accounts to optimize float an analytic study of exact and approximate algorithms . Alymt Sci. , 23 , 789 .
- EDMONDS , .J. , 1965 , Paths, trees and flowers. Can. J. Math. , 17 , 449 .
- EMMONDS , H. , 1978 , A Survey of Static, Job Slurp Scliediilivy Theory . Case Western Reserve Working Paper .
- GRAHAM , R. L. , LAWLER , E. L. , LENSTRA , J. K. ,RINNOOY KAN , A. H. G. , 1977 , Optimization and approximation in deterministic sequencing and scheduling a survey . Proceedings oj Discrete Optimization - 1977 ( North Holland ), p. 287 .
- JACKSON , J. R. , 1955 , Scheduling a production Line to Minimize Maximum Tardiness. Research Report 43 ( UCLA ).
- KARP , R. M. , 1976 , The probabilistic analysis of some combinatorial search algorithms . Algorithms and Complexity ( Academic Press ), pp. 1 – 19 .
- LACEWEG , B. J. , LENSTRA,.J. K.,RINNOOY KAN , A. H. G. , 1976 , Minimizing maximum lateness on one machine . Statistica neerlandka , 30 , 25 .
- LARSON , R. E. and DEBSOUKY , M. I. , 1978 , Heuristic procedures for the single machine problem to minimize maximum lateness . A.I I. Trans. , 10 , 176 .
- McMAHON , G. and FLORIAN , M. , 1975 , On scheduling with ready times and due dates to minimize maximum lateness , Ops Res. , 23 , 475 .
- MAGAZINE , M.J. , NEMHAUSER , G. L. and TROTTER , L. E. , 1975 , When the greedy solution solves a class of knapsack problems . Ops Res. , 23 , 207 .
- SCHRAGE , L. , 1971 , Obtaining optimal solutions to resource constrained network scheduling problems . Proceedings of the. Systems Engineering Conference , Phoenix , Arizona .