IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v62y2005i1p77-97.html
   My bibliography  Save this article

Fixed-time schedules for the processing of jobs when service completions are not observable

Author

Listed:
  • K.D. Glazebrook
  • E.L. Punton

Abstract

We argue the importance of studying service systems in which the successful completion of job/customer service cannot be observed contemporaneously. Military and other applications are cited. The allocation of a large amount of processing to a job may make its (unobservable) successful completion more likely but will impose a burden on other jobs awaiting service. A fixed-time schedule specifies both the order in which jobs should be processed and how much processing each should receive. The goal is to find schedules which maximise the total expected reward earned from all jobs served. While this problem is intractable in general, a range of characterisations of optimal fixed-time schedules is achieved for given scenarios. The development of effective heuristics is also discussed. Copyright Springer-Verlag Berlin Heidelberg 2005

Suggested Citation

  • K.D. Glazebrook & E.L. Punton, 2005. "Fixed-time schedules for the processing of jobs when service completions are not observable," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 62(1), pages 77-97, September.
    • Handle: RePEc:spr:mathme:v:62:y:2005:i:1:p:77-97
    DOI: 10.1007/s00186-005-0442-5
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s00186-005-0442-5
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s00186-005-0442-5?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. Kevin D. Glazebrook & Emma L. Punton, 2008. "Dynamic policies for uncertain time‐critical tasking problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(2), pages 142-155, March.

    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:spr:mathme:v:62:y:2005:i:1:p:77-97. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.