COMMON DUE-DATE ASSIGNMENT AND SCHEDULING FOR A SINGLE PROCESSOR TO MINIMIZE THE NUMBER OF TARDY JOBS

References

• Baker , K. R. ( 1974 ) Introduction to Scheduling and Sequencing . John Wiley , New York .
   Google Scholar
• Cheng , T. C. E. ( 1984 ) Optimal due-date determination and sequencing of n jobs on a single machine . Journal of the Operational Research Society , 35 , 433 – 437 .
   Web of Science ®Google Scholar
• Cheng , T. C. E. ( 1986 ) Optimal due-date assignment in a job shop . International Journal of Production Research , 24 , 503 – 515 .
   Web of Science ®Google Scholar
• Cheng , T. C. E. ( 1987 ) An algorithm for the CON due-date determination and sequencing problem . Computers and Operations Research , 14 , 537 – 542 .
   Web of Science ®Google Scholar
• Cheng , T. C. E. and Gupta , M.C. ( 1989 ) Survey of scheduling research involving due-date detemination decisions . European Journal of Operational Research , 38 , 156 – 166 .
   Web of Science ®Google Scholar
• Conway , R. W. ( 1965 ) Priority dispatching and job lateness in a job shop . Journal of Industrial Engineering , 16 , 228 – 237 .
   Web of Science ®Google Scholar
• Dilworth , J. B. ( 1989 ) Production and Operations Management , Random House , New York .
   Google Scholar
• Eilon , S. and Chowdhury , I. J. ( 1976 ) Due-dates in job shop scheduling . International Journal of Production Research , 14 . 223 – 237 .
   Google Scholar
• Fisher , M. L. and Jaikumar , R. ( 1978 ) An algorithm for the space shuttle scheduling . Operations Research , 26 , 166 – 182 .
   Google Scholar
• Garey , M. R. and Johnson , D. S. ( 1979 ) Computers and Intractability A Guideline to the Theory of NP-Completeness . W. H. Freeman , New York .
   Google Scholar
• Kanet , J. J. ( 1981 ) Minimizing the average deviation of job completion times about a common due-dates . Naval Research Logistics Quarterly , 28 , 643 – 651 .
   Google Scholar
• Kise , H. , Ibraki , T. and Mine , H. ( 1978 ) A solvable case of the one machine scheduling problem with ready times and due dates . Operations Research , 21 , 121 – 126 .
   Google Scholar
• Moore , J. M. ( 1968 ) An n-job, one-machine sequence problem for minimizing the number of late jobs . Management Science , 15 , 102 – 109 .
   Web of Science ®Google Scholar
• Orlicky , J. ( 1975 ) Materials Requirements Planning . McGraw-Hill , New York .
   Google Scholar
• Panwalkar , S. S. , Smith , M. L. and Seidmann , A. ( 1982 ) Common due-date assignment to minimize total penalty for the one machine sequencing problem . Operations Research , 30 , 391 – 399 .
   Web of Science ®Google Scholar
• Ragatz , G. L. and Mabert , V. A. ( 1984 ) A framework for the study of due-date management in job shops . International Journal of Production Research , |v22|V, 685 – 695 .
   Google Scholar
• Seidmann , A. , Panwalkar , S. S. and Smith , M. L. ( 1981 ) Optimal assignment of due-dates for a single processor scheduling problem . International Journal of Production Research , 19 , 393 – 399 .
   Web of Science ®Google Scholar
• Seidmann , A. and Smith , M. L. ( 1981 ) Due-date assignment for production systems . Management Science , 27 , S 71 – 581 .
   Google Scholar
• Sidney , J. B. ( 1973 ) An extension of Moore's due-date algorithm . In Symposium on the Theory of Scheduling and its Application , Elmaghraby, S. E. (ed ), Springer , New York .
   Google Scholar
• Weeks , J. K. and Fryer , J. S. ( 1977 ) A methodology for assigning minimum cost due-dates . Management Science , 23 , 872 – 881 .
   Web of Science ®Google Scholar