IDEAS home Printed from https://ideas.repec.org/p/ete/kbiper/533582.html
   My bibliography  Save this paper

No-wait scheduling for locks

Author

Listed:
  • Ward Passchyn
  • Dirk Briskorn
  • Frits Spieksma

Abstract

We investigate a problem inspired by the practical setting of scheduling a lock with parallel chambers. We show how this problem relates to known interval scheduling problems, as well as to a particular graph coloring problem on multiple unit interval graphs. We explore the relationships between these problems and discuss the complexity of different problem variants. In particular, for a lock consisting of two chambers we are able to characterize the feasible instances and use this result to obtain efficient algorithms. We also provide an efficient algorithm for the special case with identical lock chambers. Furthermore, we describe a dynamic programming approach for the more general case with arbitrary chambers, and prove that the problem is strongly NP-complete when the number of chambers is part of the input.

Suggested Citation

  • Ward Passchyn & Dirk Briskorn & Frits Spieksma, 2016. "No-wait scheduling for locks," Working Papers of Department of Decision Sciences and Information Management, Leuven 533582, KU Leuven, Faculty of Economics and Business (FEB), Department of Decision Sciences and Information Management, Leuven.
    • Handle: RePEc:ete:kbiper:533582
    as

    Download full text from publisher

    File URL: https://lirias.kuleuven.be/retrieve/376904
    File Function: No-wait scheduling for locks
    Download Restriction: no
    ---><---

    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:ete:kbiper:533582. 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: library EBIB (email available below). General contact details of provider: https://feb.kuleuven.be/KBI .

    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.