Abstract
This paper considers the problem of minimizing the range of lateness on a single machine. All the algorithms in the literature for solving this problem are based on the branch-and-bound approach, which has an exponential time complexity. In this paper, we demonstrate that this problem can actually be solved in pseudo-polynomial time, and develop such an algorithm. Computational performance of this algorithm on problems with various sizes is provided.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Liao, CJ., Huang, RH. An Algorithm for Minimizing the Range of Lateness on a Single Machine. J Oper Res Soc 42, 183–186 (1991). https://doi.org/10.1057/jors.1991.32
Published:
Issue Date:
DOI: https://doi.org/10.1057/jors.1991.32