Skip to main content
SpringerLink
Log in

Improved Bounds for the Range of Lateness on a Single Machine

  • Theoretical Paper
  • Published:
Journal of the Operational Research Society

Abstract

In a recent article, Gupta and Sen have developed an algorithm to minimize the range of lateness on a single machine. The algorithm is based on the branch-and-bound approach suggested by Townsend for single-machine problems with quadratic penalty functions of completion times. In this paper, a simple general result for regular composition of cost functions is presented, application of which improves the Gupta and Sen procedure.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Charles University, Prague, Czechoslovakia

    M. Tegze & M. Vlach

Authors
  1. M. Tegze
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Vlach
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tegze, M., Vlach, M. Improved Bounds for the Range of Lateness on a Single Machine. J Oper Res Soc 39, 675–680 (1988). https://doi.org/10.1057/jors.1988.114

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1057/jors.1988.114

Keywords

Search

Navigation