Minimization of total absolute deviation for a common due date

References

• Adamopoulos , G. I. and Pappis , C. P. 1996 . Theory methodology: scheduling jobs with different,job-dependent earliness tardiness penalties using SLK method . European Journal of Operational Research , 88 : 336 – 344 .
   Web of Science ®Google Scholar
• Baker , K. R. and Scudder , G. D. 1990 . Sequencing with earliness tardiness penalties: a review . Operations Research , 38 : 22 – 36 .
   Web of Science ®Google Scholar
• Sector , C. R. , Gupta , Y. P. and Gupta , M. C. 1988 . Determination of an optimal common due date optima! sequence in a single machine job shop . International Journal of Production Research , 26 ( 4 ) : 613 – 628 .
   Google Scholar
• Chang , Y. L. 1986 . Minimizing mean absolute deviation of completion times about a common due date . Naval Research Logistics , 33 : 227 – 240 .
   Google Scholar
• Cheng , T. C. E. 1987 . An algorithm for the con due-date determination sequencing problem . Computers Operations Research , 14 : 537 – 542 .
   Web of Science ®Google Scholar
• Cheng , T. C. E. 1989 . A heuristic for common due-date assignment job scheduling on parallel machines . Journal of Operational Research Society , 40 : 1129 – 1135 .
   Web of Science ®Google Scholar
• De , P. , Ghosh , J. B. and Wells , C. E. 1991 . On the multiple-machine to a common due-date assignment scheduling problem . Journal of Operational Research Society , 42 : 419 – 422 .
   Web of Science ®Google Scholar
• Emmons , H. 1987 . Scheduling to a common due date on parallel uniform processors . Naval Research Logistics , 34 : 803 – 810 .
   Web of Science ®Google Scholar
• Glover , R. 1986 . Future paths for integer programming links to artificial intelligence . Computers Operations Research , 5 : 533 – 549 .
   Web of Science ®Google Scholar
• Glover , F. and Laguna , M. 1993 . Modern Heuristic Techniques for Combinatorial Problems , John Wiley .
   Google Scholar
• Kanet , J. J. 1981 . Minimizing the average deviation of job completion times about a common due date . Naval Research Logistics Quarterly , 28 : 643 – 651 .
   Google Scholar
• Mittenthal , J. , Raghavachari , M. and Rana , A. I. 1993 . A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions . Computers & Operations Research , 20 ( 2 ) : 103 – 111 .
   Google Scholar
• Panwalkar , S. S. and Smith , M. L. 1982 . Common due date assignment to minimize total penalty for the one machine scheduling problem . Operations Research , 30 : 391 – 399 .
   Web of Science ®Google Scholar
• Raghavachari , M. 1986 . A V-shape property of optimal schedule of jobs about a common due date . European Journal of Operational Research , 23 : 401 – 402 .
   Web of Science ®Google Scholar
• Szwarc , W. 1989 . Single-machine scheduling to minimize absolute derivation of completion times from a common due date . Naval Research Logistics , 36 : 663 – 673 .
   Google Scholar
• Szwarc , W. 1996 . The weighted common due date single machine scheduling problem revisited . Computers Operations Research , 23 : 255 – 262 .
   Google Scholar