IDEAS home Printed from https://ideas.repec.org/a/spr/jsched/v22y2019i1d10.1007_s10951-018-0595-8.html
   My bibliography  Save this article

Inductive $$k$$ k -independent graphs and c-colorable subgraphs in scheduling: a review

Author

Listed:
  • Matthias Bentert

    (Algorithmics and Computational Complexity, Faculty IV)

  • René Bevern

    (Novosibirsk State University
    Sobolev Institute of Mathematics of the Siberian Branch of the Russian Academy of Sciences)

  • Rolf Niedermeier

    (Algorithmics and Computational Complexity, Faculty IV)

Abstract

Inductive $$k$$ k -independent graphs generalize chordal graphs and have recently been advocated in the context of interference-avoiding wireless communication scheduling. The NP-hard problem of finding maximum-weight induced c-colorable subgraphs, which is a generalization of finding maximum independent sets, naturally occurs when selecting $$c$$ c sets of pairwise non-conflicting jobs (modeled as graph vertices). We investigate the parameterized complexity of this problem on inductive $$k$$ k -independent graphs. We show that the Maximum Independent Set problem is W[1]-hard even on 2-simplicial 3-minoes—a subclass of inductive 2-independent graphs. In contrast, we prove that the more general Max-Weightc-Colorable Subgraph problem is fixed-parameter tractable on edge-wise unions of cluster and chordal graphs, which are 2-simplicial. In both cases, the parameter is the solution size. Aside from this, we survey other graph classes between inductive $$1$$ 1 -independent and inductive $$2$$ 2 -independent graphs with applications in scheduling.

Suggested Citation

  • Matthias Bentert & René Bevern & Rolf Niedermeier, 2019. "Inductive $$k$$ k -independent graphs and c-colorable subgraphs in scheduling: a review," Journal of Scheduling, Springer, vol. 22(1), pages 3-20, February.
    • Handle: RePEc:spr:jsched:v:22:y:2019:i:1:d:10.1007_s10951-018-0595-8
    DOI: 10.1007/s10951-018-0595-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10951-018-0595-8
    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-018-0595-8?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. Antoon W.J. Kolen & Jan Karel Lenstra & Christos H. Papadimitriou & Frits C.R. Spieksma, 2007. "Interval scheduling: A survey," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(5), pages 530-543, August.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Matthias Bentert & Robert Bredereck & Péter Györgyi & Andrzej Kaczmarczyk & Rolf Niedermeier, 2023. "A multivariate complexity analysis of the material consumption scheduling problem," Journal of Scheduling, Springer, vol. 26(4), pages 369-382, August.
    2. Kuryatnikova, Olga & Sotirov, Renata & Vera, J.C., 2022. "The maximum $k$-colorable subgraph problem and related problems," Other publications TiSEM 40e477c0-a78e-4ee1-92de-8, Tilburg University, School of Economics and Management.
    3. Olga Kuryatnikova & Renata Sotirov & Juan C. Vera, 2022. "The Maximum k -Colorable Subgraph Problem and Related Problems," INFORMS Journal on Computing, INFORMS, vol. 34(1), pages 656-669, January.
    4. Klaus Heeger & Danny Hermelin & George B. Mertzios & Hendrik Molter & Rolf Niedermeier & Dvir Shabtay, 2023. "Equitable scheduling on a single machine," Journal of Scheduling, Springer, vol. 26(2), pages 209-225, April.

    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. Boysen, Nils & Briskorn, Dirk & Schwerdfeger, Stefan, 2019. "Matching supply and demand in a sharing economy: Classification, computational complexity, and application," European Journal of Operational Research, Elsevier, vol. 278(2), pages 578-595.
    2. 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.
    3. 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.
    4. 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.
    5. Nils Boysen & Stefan Fedtke & Felix Weidinger, 2017. "Truck Scheduling in the Postal Service Industry," Transportation Science, INFORMS, vol. 51(2), pages 723-736, May.
    6. de Weerdt, Mathijs & Baart, Robert & He, Lei, 2021. "Single-machine scheduling with release times, deadlines, setup times, and rejection," European Journal of Operational Research, Elsevier, vol. 291(2), pages 629-639.
    7. Nicolas Pinson & Frits C. R. Spieksma, 2019. "Online interval scheduling on two related machines: the power of lookahead," Journal of Combinatorial Optimization, Springer, vol. 38(1), pages 224-253, July.
    8. Julie Poullet & Axel Parmentier, 2020. "Shift Planning Under Delay Uncertainty at Air France: A Vehicle-Scheduling Problem with Outsourcing," Transportation Science, INFORMS, vol. 54(4), pages 956-972, July.
    9. 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.
    10. Martinovic, J. & Strasdat, N. & Valério de Carvalho, J. & Furini, F., 2023. "A combinatorial flow-based formulation for temporal bin packing problems," European Journal of Operational Research, Elsevier, vol. 307(2), pages 554-574.
    11. 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.
    12. Arne Herzel & Michael Hopf & Clemens Thielen, 2019. "Multistage interval scheduling games," Journal of Scheduling, Springer, vol. 22(3), pages 359-377, June.
    13. Dienstknecht, Michael & Briskorn, Dirk, 2024. "Sharing in construction projects — On determining optimal container assignments for the on-site accommodation of trades," European Journal of Operational Research, Elsevier, vol. 315(1), pages 324-337.
    14. Felix Weidinger & Nils Boysen & Dirk Briskorn, 2018. "Storage Assignment with Rack-Moving Mobile Robots in KIVA Warehouses," Service Science, INFORMS, vol. 52(6), pages 1479-1495, December.
    15. Dimitrios Letsios & Jeremy T. Bradley & Suraj G & Ruth Misener & Natasha Page, 2021. "Approximate and robust bounded job start scheduling for Royal Mail delivery offices," Journal of Scheduling, Springer, vol. 24(2), pages 237-258, April.
    16. Tadumadze, Giorgi & Boysen, Nils & Emde, Simon & Weidinger, Felix, 2019. "Integrated truck and workforce scheduling to accelerate the unloading of trucks," European Journal of Operational Research, Elsevier, vol. 278(1), pages 343-362.

    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:22:y:2019:i:1:d:10.1007_s10951-018-0595-8. 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.