IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v42y1995i6p993-1005.html
   My bibliography  Save this article

A suboptimality bound for permutation policies in single machine stochastic scheduling

Author

Listed:
  • K. D. Glazebrook

Abstract

A general class of single machine stochastic scheduling problems incorporating precedence constraints is modelled as a family of competing Markov decision processes. A bound on the optimal return yields a suboptimality bound for permutation policies. This in turn leads to a generalised “used better than new” principle as a (highly intuitive) sufficient condition for the optimality of a permutation policy in the class of all (preemptive) policies. © 1995 John Wiley & Sons, Inc.

Suggested Citation

  • K. D. Glazebrook, 1995. "A suboptimality bound for permutation policies in single machine stochastic scheduling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 42(6), pages 993-1005, September.
    • Handle: RePEc:wly:navres:v:42:y:1995:i:6:p:993-1005
    DOI: 10.1002/1520-6750(199509)42:63.0.CO;2-P
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/1520-6750(199509)42:63.0.CO;2-P
    Download Restriction: no
    File URL: https://libkey.io/10.1002/1520-6750(199509)42:63.0.CO;2-P?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
    ---><---

    References listed on IDEAS

    as
    1. K. D. Glazebrook & R. W. Owen, 1995. "Gittins‐index heuristics for research planning," Naval Research Logistics (NRL), John Wiley & Sons, vol. 42(7), pages 1041-1062, October.
    2. B. P. Banerjee, 1965. "Single Facility Sequencing with Random Execution Times," Operations Research, INFORMS, vol. 13(3), pages 358-364, June.
    3. K. D. Glazebrook & J. C. Gittins, 1981. "On Single-Machine Scheduling with Precedence Relations and Linear or Discounted Costs," Operations Research, INFORMS, vol. 29(1), pages 161-173, February.
    4. K. D. Glazebrook, 1981. "On nonpreemptive strategies in stochastic scheduling," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 28(2), pages 289-300, June.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Seyed M. R. Iravani & John A. Buzacott & Morton J. M. Posner, 2003. "Operations and Shipment Scheduling of a Batch on a Felxible Machine," Operations Research, INFORMS, vol. 51(4), pages 585-601, August.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. S. E. Pilnick & K. D. Glazebrook & D. P. Gaver, 1991. "Optimal sequential replenishment of ships during combat," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(5), pages 637-668, October.
    2. Elmaghraby, Salah E., 2001. "On the optimal release time of jobs with random processing times, with extensions to other criteria," International Journal of Production Economics, Elsevier, vol. 74(1-3), pages 103-113, December.
    3. J. Birge & J. B. G. Frenk & J. Mittenthal & A. H. G. Rinnooy Kan, 1990. "Single‐machine scheduling subject to stochastic breakdowns," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(5), pages 661-677, October.
    4. K. D. Glazebrook, 1992. "Single‐machine scheduling of stochastic jobs subject to deterioration or delay," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(5), pages 613-633, August.
    5. Jonathan Bard & David Morton & Yong Wang, 2007. "Workforce planning at USPS mail processing and distribution centers using stochastic optimization," Annals of Operations Research, Springer, vol. 155(1), pages 51-78, November.
    6. Kevin D. Glazebrook, 1987. "Evaluating the effects of machine breakdowns in stochastic scheduling problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(3), pages 319-335, June.

    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:navres:v:42:y:1995:i:6:p:993-1005. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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)1520-6750 .

    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.