IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v58y2007i1d10.1057_palgrave.jors.2602124.html
   My bibliography  Save this article

On-line scheduling with forbidden zones

Author

Listed:
  • K Khammuang

    (The University of Melbourne)

  • A Abdekhodaee

    (Commonwealth Scientific and Industrial Research Organisation)

  • A Wirth

    (The University of Melbourne)

Abstract

In various manufacturing and computing contexts there may be a certain period in each time interval, during which processing may continue but may not be initiated. We examine the problem of on-line scheduling in the presence of such forbidden zones, whose complements are starting time windows. We show that no on-line algorithm is better than [frac97]-competitive, when minimizing the number of intervals used (essentially the makespan), whereas list scheduling is shown to be 2-competitive. We also investigate adaptations of the first fit, next fit and harmonic bin packing algorithms and test all four empirically.

Suggested Citation

  • K Khammuang & A Abdekhodaee & A Wirth, 2007. "On-line scheduling with forbidden zones," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(1), pages 80-90, January.
    • Handle: RePEc:pal:jorsoc:v:58:y:2007:i:1:d:10.1057_palgrave.jors.2602124
    DOI: 10.1057/palgrave.jors.2602124
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2602124
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2602124?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.

    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:pal:jorsoc:v:58:y:2007:i:1:d:10.1057_palgrave.jors.2602124. 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.palgrave-journals.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.