Scheduling a Single Machine to Minimize the Weighted Number of Tardy Jobs

References

• Garey , M. R. and Johnson , D. S. ;, Computers and Intractability: A Guide to the Theory ofjVSP'-Completeness , W. H. Freeman and Company , San Francisco ( 1979 ).
   Google Scholar
• Geoffrion , A. M. and Marsten , R. E. , “ Integer Programming Algorithms: A Framework and State-of-the-Art Survey ,” Management Science 18 , 465 – 491 ( 1972 ).
   Web of Science ®Google Scholar
• Graham , R. L. , Lawler , E. L. , Lenstra , J. K. , and Rinnooy Kan , A. H.G. , “ Optimization and Approximation in Deterministic Sequencing and Scheduling ,” Annals of Discrete Mathematics 5 , 287 – 326 ( 1979 ).
   Google Scholar
• Karp , R. M. , “ Reducibility Among Combinatorial Algorithms ,” in Complexity of Computer Computations , R. E. Miller and J. W. Thatcher (eds.) , Plenum Press , NY 85–103 ( 1972 ).
   Google Scholar
• Kise , H. , Ibaraki , T. , and Mine , H. , “ A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times ,” Operations Research 26 , 121 – 126 ( 1978 ).
   Web of Science ®Google Scholar
• Lauriere , M. , “ An Algorithm for the 0/1 Knapsack Problem ,” Mathematical Programming 14 , 1 – 10 ( 1978 ).
   Web of Science ®Google Scholar
• Lawler , E. L. , “ On Scheduling Problems with Deferral Costs ,” Management Science 11 , 280 – 288 ( 1964 ).
   Web of Science ®Google Scholar
• Lawler , E. L. , Combinatorial Optimization: Networks and Matroids , Holt, Rinehart and Winston , NY ( 1976 ).
   Google Scholar
• Lawler , E. L. , “ Sequencingto Minimize the Weighted Number of Tardy Jobs ,” Recherche Operationnelle 10 , 17 – 33 ( 1976 ).
   Google Scholar
• Lawler , E. L. and Moore , J. M. , “ A Functional Equation and Its Application to Resource Allocation and Sequencing Problems ,” Management Science 16 , 77 – 84 ( 1969 ).
   Web of Science ®Google Scholar
• Moore , J. M. , “ An n-Job, One-Machine Sequencing Algorithm for Minimizing the Number of Late Jobs ,” Management Science 15 , 102 – 109 ( 1968 ).
   Web of Science ®Google Scholar
• Parker , R. G. and Rardin , R. L. , “ An Overview of Complexity Theory in Discrete Optimization: Part I. Concepts ,” HE TRANSACTIONS 14 , 3 – 20 ( 1982 ).
   Google Scholar
• Parker , R. G. and Rardin , R. L. , “ An Overview of Complexity Theory in Discrete Optimization: Part II. Results and Implications ,” HE TRANSACTIONS 14 , 83 – 89 ( 1982 ).
   Google Scholar
• Rinnooy Kan , A. H.G. , Machine Scheduling Problems , Marti-nus Nijhoff , The Hague ( 1976 ).
   Google Scholar
• Rinnooy Kan , A. H. G., Lageweg , B. J. , and Lenstra , J. K. , “ Minimizing Total Cost in One-Machine Scheduling ,” Operations Research 23 , 908 – 927 ( 1975 ).
   Web of Science ®Google Scholar
• Sahni , S. , “ Algorithms for Scheduling Independent Tasks ,” Journal of the ACM 23 , 116 – 127 ( 1976 ).
   Web of Science ®Google Scholar
• Sidney , J. B. , “ An Extension of Moore's Due Date Algorithm ,” in Symposium on the Theory of Scheduling and Its Applications, S. E. Elmaghraby (ed) , Springer-Verlag , Berlin , 393–398 ( 1973 ).
   Google Scholar