Minimizing the range of lateness on a single machine Article

Gupta, S, An Sen, T. (1984). Minimizing the range of lateness on a single machine . JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 35(9), 853-857. 10.1057/jors.1984.168

cited authors

  • Gupta, S; An Sen, T

authors

abstract

  • This paper gives an optimizing algorithm to minimize the range of lateness, that is the difference between the maximum and minimum lateness, of jobs in a single-machine sequencing problem. The procedure is based on a branch-and-bound technique. One example has been solved to illustrate the method. © 1984 Operational Research Society Ltd.

publication date

  • January 1, 1984

published in

Digital Object Identifier (DOI)

start page

  • 853

end page

  • 857

volume

  • 35

issue

  • 9