IDEAS home Printed from https://ideas.repec.org/a/wly/navlog/v26y1979i3p537-544.html
   My bibliography  Save this article

On n/1/F̄ dynamic deterministic problems

Author

Listed:
  • Ramesh Chandra

Abstract

We consider sequencing of n jobs which will arrive intermittently and are to be processed on a single machine; the arrival and the processing times of each jobs are assumed known. A schedule is to be developed that minimizes the mean flow time. Two models are considered: (i) when no pre‐emption or inserted idle time is allowed in the schedule, and (ii) when pre‐emption is allowed but the jobs follow a pre‐empt‐repeat discipline We illustrate that Cobham's and Phipp's SPT dispatching rule does not guarantee the optimum F̄ even for the non‐preemptive model We propose a branch and bound algorithm for both models and discuss our computational experience We also examine the relative performances of the optimum nonpre‐emptive sequence, and the optimum pre‐empt‐repeat sequence over that resulting from SPT dispatching rule on a large number of sets of jobs of varying sizes and tightness.

Suggested Citation

  • Ramesh Chandra, 1979. "On n/1/F̄ dynamic deterministic problems," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 26(3), pages 537-544, September.
    • Handle: RePEc:wly:navlog:v:26:y:1979:i:3:p:537-544
    DOI: 10.1002/nav.3800260315
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.3800260315
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.3800260315?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
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Reza H. Ahmadi & Uttarayan Bagchi, 1990. "Lower bounds for single‐machine scheduling problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(6), pages 967-979, December.

    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:wly:navlog:v:26:y:1979:i:3:p:537-544. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1931-9193 .

    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.