Determination of an optimal common due date and optimal sequence in a single machine job shop

References

• BAGCHI , U. , SULLIVAN , R. S. , and CHANG , Y. L. , 1986 , Minimizing mean absolute deviation of completion times about a common due date . Naval Research Logistics Quarterly , 33 , 227 – 240 .
   Google Scholar
• BAKHR , K. R. , 1974 , Introduction to Sequencing and Scheduling ( New York John Wiley ).
   Google Scholar
• BAKER , K. R. , and BERTRAND , J. W. M. , 1981 , A comparison of due date selection rules . AIIE Transactions , 13 , 123 – 131 .
   Web of Science ®Google Scholar
• BLACKSTONE , J. H. , PHILLIPS , D. T. , and HOGG , G. L. , 1982 , State of the art survey dispatchingrules for manufacturing job shop operations . International Journal of ProductionResearch , 20 , 27 – 45 .
   Web of Science ®Google Scholar
• CHENG , T. C. E. , 1983 , A duality approach to optimal due date determination . 9 , 127 – 130 .
   Google Scholar
• CHENG , T. C. E. , 1986 , Optimal due date assignment in a jobshop . International Journal ofProduction Research , 24 , 503 – 515 .
   Web of Science ®Google Scholar
• CONWAY , R. W. , MAXWELL , W. L. , and MILLER , L. W. , 1967 , Theory of Scheduling ( Reading , Mass Addison Wesley Publishing Co ).
   Google Scholar
• EILON , S. , and CHOWDHARY , I. J. , 1976 , Due date in jobshop scheduling . International Journal ofProduction Research , 14 , 223 – 237 .
   Google Scholar
• FRANCIS , R. L. , and WHITE , J. A. , 1974 , Facility Layout and Location An Analytical Approach ( Englewood Cliffs , NJ Prentice-Hall Inc. ).
   Google Scholar
• FRENCH , S. , 1983 , Sequencing and scheduling ( Chichester John Wiley & Sons ) .
   Google Scholar
• HADLEY , G. , 1962 , Linear Programming ( Reading , Mass Addison Wesley Publishing Co., Inc. ).
   Google Scholar
• KANET , J. J. , 1981 , Minimizing the average deviation of job completion times about a commondue date . Naval Research Logistics Quarterly , 28 , 643 – 651 .
   Google Scholar
• PANWALKAR , S. S. , SMITH , M. L. , and SEIDMAN , A. , 1982 , Common due date assignment tominimizing total penalty for the one machine scheduling problems . Operations Research , 30 , 391 – 399 .
   Web of Science ®Google Scholar
• SEIDMANN , A. , PANWALKAR , S. S. , and SMITH , A. , 1981 , Optimal assignment of due date for asingle processor scheduling problems . International Journal of Production Research , 19 , 393 – 399 .
   Web of Science ®Google Scholar
• SEN , T. , and GUPTA , S. K. , 1984 , A state of art survey of static scheduling research involving duedates . Omega , 12 , 63 – 76 .
   Web of Science ®Google Scholar
• SUNDERARAGHAVAN , P. S. , and AHMED , M. U. , 1984 , Minimizing the sum of absolute lateness insingle machine and multimachine scheduling . Naval Research Logistics Quarterly , 31 , 325 – 333 .
   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