A branch and bound procedure to minimize mean absolute lateness on a single processor

Computers and Operations Research

Volumn 23, Issue 2, 1996, Pages 171-182

  Fry, Timothy D ^a   Armstrong, Ronald D ^b   Darby Dowman, Kenneth ^c   Philipoom, Patrick R ^a  

^a UNIVERSITY OF SOUTH CAROLINA   (United States)

^b RUTGERS UNIVERSITY   (United States)

^c UNIVERSITY OF WESTMINSTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038876938     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/0305-0548(95)00008-A     Document Type: Article

References (20)

1. J. B. Sidney, Optimal single machine scheduling with earliness and tardiness penalties. Opns. Res. 25, 62-69 (1977).
2. L. Lakshiminarayan, L. Lakshmanan, R. L. Papineau and R. Rochette, Optimal single-machine scheduling with earliness and tardiness penalties. Opns. Res. 26, 1079-1082 (1978).
3. A. G. Merten and M. E. Muller, Variance minimization in single machine scheduling problems. Mgmt Sci. 18, 518-528 (1972).
4. L. Schrage, Minimizing the time-in-systems variance for a finite jobset. Mgmt Sci. 21, 540-543 (1975).
5. S. Eilon and I. E. Chowdhury, Minimizing waiting time variance in the single machine. Mgmt Sci. 23, 567-575 (1977).
6. S. K. Gupta and T. Sen, Minimizing a quadratic function of job lateness on a single machine. Engng Costs Product. Econ. 7, 187-192 (1983).
7. J. K. Kanet, Minimizing the average deviation of job completion times about a common due date. Nav. Res. Logist. 28, 643-651 (1981).
8. S. S. Panwalker, M. L. Smith and A. Seidmann, Common due date assignment to minimize total penalty for the one machine scheduling problem. Opns. Res. 30, 391-399 (1982).
9. P. S. Sundararghavan and M. U. Ahmed. Minimizing the sum of absolute lateness in single-machine and multi-machine scheduling. Nav. Res. Logist. 31, 325-333 (1984).
10. U. Bagchi, Y. L. Chang and R. S. Sullivan, Minimizing mean squared deviation of completed times about a common due date. Mgmt Sci. 33, 894-906 (1987).
11. U. Bagchi, Y. L. Chang and R. S. Sullivan, Minimizing absolute and squared deviations of completed times with different earliness and tardiness penalties and a common due date. Nav. Res. Logist. 34, 739-751 (1987).
12. N. G. Hall and M. E. Posner, Earliness-tardiness scheduling problems, I: weighted deviation of completion times about a common due date. Opns Res. 39, 836-846 (1991).
13. M. R. Garey, R. E. Tarjan and G. T. Wilfong, One-processor scheduling with symmetric earliness and tardiness penalties. Math. Opns. Res. 13, 330-348 (1988).
14. T. Abdul-Razag and C. Potts, Dynamic programming state-space relaxation for single-machine scheduling. J. Opns. Res. Soc. 39, 141-152 (1988).
15. K. R. Baker and L. E. Schrage, Finding an optimal sequence by dynamic programming: an extension to precedence related tasks. Opns. Res. 26, 111-119 (1978).
16. C. N. Potts and L. N. Van Wassenhove, A decomposition algorithm for the single machine total tardiness problem. Opns. Res. Lett. 1, 177-181 (1982).
17. K. R. Baker and G. D. Scudder, Sequencing with earliness and tardiness penalties: a review. Opns. Res. 38, 22-36 (1990).
18. T. D. Fry, R. D. Armstrong and J. H. Blackstone, Minimizing weighted absolute deviation in single machine scheduling. IIE Trans. 19, 445-449 (1987).
19. C. A. Yano and Y. D. Kim, Algorithm for a class of single-machine weighted tardiness and earliness problems. Working Paper 89-4, The University of Michigan, Ann Arbor, MI (1989).
20. H. Emmons, One machine sequencing to minimize certain functions of job tardiness. Opns. Res. 17, 701-715 (1969).