IDEAS home Printed from https://ideas.repec.org/a/spr/jsched/v20y2017i5d10.1007_s10951-016-0506-9.html
   My bibliography  Save this article

Online interval scheduling with a bounded number of failures

Author

Listed:
  • Marco Bender

    (Clausthal University of Technology)

  • Clemens Thielen

    (University of Kaiserslautern)

  • Stephan Westphal

    (Clausthal University of Technology)

Abstract

We consider the problem of scheduling intervals on m identical machines where each interval can be seen as a job with fixed start and end time. The goal is to accept a maximum cardinality subset of the given intervals and assign these intervals to the machines subject to the constraint that no two intervals assigned to the same machine overlap. We analyze an online version of this problem where, initially, a set of n potential intervals and an upper bound k on the number of failing intervals is given. If an interval fails, it can be accepted neither by the online algorithm nor by the adversary. An online algorithm learns that an interval fails at the time when it is supposed to be started. If a non-failing interval is accepted, it cannot be aborted and must be processed non-preemptively until completion. For different settings of this problem, we present deterministic and randomized online algorithms and prove lower bounds on the competitive ratio.

Suggested Citation

  • Marco Bender & Clemens Thielen & Stephan Westphal, 2017. "Online interval scheduling with a bounded number of failures," Journal of Scheduling, Springer, vol. 20(5), pages 443-457, October.
    • Handle: RePEc:spr:jsched:v:20:y:2017:i:5:d:10.1007_s10951-016-0506-9
    DOI: 10.1007/s10951-016-0506-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10951-016-0506-9
    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-016-0506-9?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.

    References listed on IDEAS

    as
    1. Kovalyov, Mikhail Y. & Ng, C.T. & Cheng, T.C. Edwin, 2007. "Fixed interval scheduling: Models, applications, computational complexity and algorithms," European Journal of Operational Research, Elsevier, vol. 178(2), pages 331-342, April.
    2. Lisa Fleischer & Michel X. Goemans & Vahab S. Mirrokni & Maxim Sviridenko, 2011. "Tight Approximation Algorithms for Maximum Separable Assignment Problems," Mathematics of Operations Research, INFORMS, vol. 36(3), pages 416-431, August.
    Full references (including those not matched with items on IDEAS)

    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. Ge Yu & Sheldon H. Jacobson, 2020. "Primal-dual analysis for online interval scheduling problems," Journal of Global Optimization, Springer, vol. 77(3), pages 575-602, July.
    2. Slotnick, Susan A., 2011. "Order acceptance and scheduling: A taxonomy and review," European Journal of Operational Research, Elsevier, vol. 212(1), pages 1-11, July.
    3. Lee, Soonhui & Turner, Jonathan & Daskin, Mark S. & Homem-de-Mello, Tito & Smilowitz, Karen, 2012. "Improving fleet utilization for carriers by interval scheduling," European Journal of Operational Research, Elsevier, vol. 218(1), pages 261-269.
    4. Ons Sassi & Ammar Oulamara, 2017. "Electric vehicle scheduling and optimal charging problem: complexity, exact and heuristic approaches," International Journal of Production Research, Taylor & Francis Journals, vol. 55(2), pages 519-535, January.
    5. Akiyoshi Shioura & Natalia V. Shakhlevich & Vitaly A. Strusevich & Bernhard Primas, 2018. "Models and algorithms for energy-efficient scheduling with immediate start of jobs," Journal of Scheduling, Springer, vol. 21(5), pages 505-516, October.
    6. Kameng Nip & Zhenbo Wang, 2019. "On the approximability of the two-phase knapsack problem," Journal of Combinatorial Optimization, Springer, vol. 38(4), pages 1155-1179, November.
    7. Diefenbach, Heiko & Emde, Simon & Glock, Christoph H., 2023. "Multi-depot electric vehicle scheduling in in-plant production logistics considering non-linear charging models," European Journal of Operational Research, Elsevier, vol. 306(2), pages 828-848.
    8. Zhao, Chuan-Li & Tang, Heng-Yong, 2010. "Scheduling deteriorating jobs under disruption," International Journal of Production Economics, Elsevier, vol. 125(2), pages 294-299, June.
    9. Di Martinelly, Christine & Meskens, Nadine, 2017. "A bi-objective integrated approach to building surgical teams and nurse schedule rosters to maximise surgical team affinities and minimise nurses' idle time," International Journal of Production Economics, Elsevier, vol. 191(C), pages 323-334.
    10. Danny Hermelin & Dvir Shabtay & Nimrod Talmon, 2019. "On the parameterized tractability of the just-in-time flow-shop scheduling problem," Journal of Scheduling, Springer, vol. 22(6), pages 663-676, December.
    11. Arne Herzel & Michael Hopf & Clemens Thielen, 2019. "Multistage interval scheduling games," Journal of Scheduling, Springer, vol. 22(3), pages 359-377, June.
    12. Wenjie Li & Jinjiang Yuan, 2015. "An Improved Online Algorithm for the Online Preemptive Scheduling of Equal-Length Intervals on a Single Machine with Lookahead," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 32(06), pages 1-9, December.
    13. Zaidi, I. & Oulamara, A. & Idoumghar, L. & Basset, M., 2024. "Minimizing grid capacity in preemptive electric vehicle charging orchestration: Complexity, exact and heuristic approaches," European Journal of Operational Research, Elsevier, vol. 312(1), pages 22-37.
    14. Janiak, Adam & Janiak, Władysław A. & Krysiak, Tomasz & Kwiatkowski, Tomasz, 2015. "A survey on scheduling problems with due windows," European Journal of Operational Research, Elsevier, vol. 242(2), pages 347-357.
    15. Türsel Eliiyi, Deniz & Azizoglu, Meral, 2011. "Heuristics for operational fixed job scheduling problems with working and spread time constraints," International Journal of Production Economics, Elsevier, vol. 132(1), pages 107-121, July.
    16. Belaid, R. & T’kindt, V. & Esswein, C., 2012. "Scheduling batches in flowshop with limited buffers in the shampoo industry," European Journal of Operational Research, Elsevier, vol. 223(2), pages 560-572.
    17. Yim, Seho & Hong, Sung-Pil & Park, Myoung-Ju & Chung, Yerim, 2022. "Inverse interval scheduling via reduction on a single machine," European Journal of Operational Research, Elsevier, vol. 303(2), pages 541-549.
    18. Yunqiang Yin & T. C. E. Cheng & Du-Juan Wang & Chin-Chia Wu, 2017. "Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs," Journal of Scheduling, Springer, vol. 20(4), pages 313-335, August.
    19. Yaron Leyvand & Dvir Shabtay & George Steiner & Liron Yedidsion, 2010. "Just-in-time scheduling with controllable processing times on parallel machines," Journal of Combinatorial Optimization, Springer, vol. 19(3), pages 347-368, April.
    20. Alexandre Mazier & Jean-Charles Billaut & Jean-François Tournamille, 2010. "Scheduling preparation of doses for a chemotherapy service," Annals of Operations Research, Springer, vol. 178(1), pages 145-154, July.

    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:20:y:2017:i:5:d:10.1007_s10951-016-0506-9. 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: 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.