This work is licensed under a
Creative Commons Attribution 4.0 International License
BAKER, K. R. 1974. Introduction to Sequencing and Scheduling. John Wiley & Sons, New York.
BAKER, K. R., AND J. W. M. BERTRAND. 1980. A Comparison of Due-Date Selection Rules, Industrial Engr. Report 1980/02, University of Technology, Eindhoven, The Netherlands.
R. W. CONWAY, W. L. MAXWELL and L. W. MILLER (1967) Theory of Scheduling. Addison-Wesley, Reading, Mass.
A. H. G. RiNNooy KAN (1976) Machine Scheduling Problems: Classification, Complexity and Computations. Martinus Nijhoff, The Hague.
S. FRENCH (1 982) Sequencing and Scheduling Ellis Horwood, Chichester.
S. S. PANWALKAR, M. L. SMITH and A. SEIDMANN (1982) Common due-date assignment to minimize total penalty for the one machine scheduling problem. Opns Res. 30, 391-399.
EILON S. AND I. J. CHOWDHURY. 1976. Due-Dates in Job Shop Scheduling. Int. J. Prod. Res. 14, 223-237.
JONES, C. H. 1973. An Economic Evaluation of Job Shop Dispatching Rules. Mgmt. Sci. 20, 293-307.
WEEKS, J. K. 1979. A Simulation Study of Predictable Due-Dates. Mgmt. Sci. 25, 363-373.
WEEKS, J. K., AND J. S. FRYER. 1977. A Methodology for Assigning Minimum CostDueDates. Mgmt. Sci. 23, 872-881.
HALL, N. 1986. Single and Multi-Processor Models for Minimizing Completion TimeVariance. Navai. Res. Logist. Quart. 33, 49-54.
SUNDARARAGHAVAN, P., AND M. AHED. 1984. Minimizing the Sum of AbsoluteLateness in Single Machine and Multimachine Scheduling. Navai. Res. Logist. Quart. 31, 325-333.