IDEAS home Printed from https://ideas.repec.org/a/spr/jsched/v24y2021i5d10.1007_s10951-021-00688-5.html
   My bibliography  Save this article

Calibrations scheduling with arbitrary lengths and activation length

Author

Listed:
  • Eric Angel

    (University Paris Saclay)

  • Evripidis Bampis

    (Sorbonne UniversitéCNRS)

  • Vincent Chau

    (Southeast University)

  • Vassilis Zissimopoulos

    (National and Kapodistrian University of Athens)

Abstract

Bender et al. (SPAA 2013) proposed a theoretical framework for testing in contexts where safety mistakes must be avoided. Testing in such a context is made by machines that need to be calibrated on a regular basis. Since calibrations have a non-negligible cost, it is important to study policies minimizing the total calibration cost while performing all the necessary tests. We focus on the single-machine setting, and we study the complexity status of different variants of the problem. First, we extend the model by considering that the jobs have arbitrary processing times, and we propose an optimal polynomial-time algorithm when the preemption of jobs is allowed. Then, we study the case where there are many types of calibrations with their corresponding lengths and costs. We prove that the problem becomes NP-hard for arbitrary processing times even when the preemption of the jobs is allowed. Finally, we focus on the case of unit processing time jobs, and we show that a more general problem, where the recalibration of the machine is not instantaneous, can be solved in polynomial time via dynamic programming.

Suggested Citation

  • Eric Angel & Evripidis Bampis & Vincent Chau & Vassilis Zissimopoulos, 2021. "Calibrations scheduling with arbitrary lengths and activation length," Journal of Scheduling, Springer, vol. 24(5), pages 459-467, October.
    • Handle: RePEc:spr:jsched:v:24:y:2021:i:5:d:10.1007_s10951-021-00688-5
    DOI: 10.1007/s10951-021-00688-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10951-021-00688-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10951-021-00688-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.

    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:jsched:v:24:y:2021:i:5:d:10.1007_s10951-021-00688-5. 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.