IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v22y1976i12p1342-1350.html
   My bibliography  Save this article

A Problem in Single-Machine Sequencing with Nonlinear Delay Costs

Author

Listed:
  • Peter B. Henderson

    (State University of New York at Stony Brook)

  • Kenneth Steiglitz

    (Princeton University)

Abstract

We examine a class of single-machine sequencing problems which originate from scheduling considerations for a single-server queueing system with nonlinear costs of delay. Associated with each request awaiting service (sequencing) are a known service time, a known arrival time, and a nondecreasing cost function which is identical for each request. Two sequencing problems are considered; a request incurs cost from its arrival time to the time when it (1) commences service or (2) completes service. Our objective is a sequence which minimizes the total incurred cost. Necessary conditions for the optimal sequencing of requests are given for convex nondecreasing and quadratic cost functions. These conditions and a new lower bound function are used in a branch-and-bound algorithm to obtain computational results.

Suggested Citation

  • Peter B. Henderson & Kenneth Steiglitz, 1976. "A Problem in Single-Machine Sequencing with Nonlinear Delay Costs," Management Science, INFORMS, vol. 22(12), pages 1342-1350, August.
    • Handle: RePEc:inm:ormnsc:v:22:y:1976:i:12:p:1342-1350
    DOI: 10.1287/mnsc.22.12.1342
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.22.12.1342
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.22.12.1342?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:22:y:1976:i:12:p:1342-1350. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.