On the parameterized complexity of interval scheduling with eligible machine sets
Authors:
- Danny HermelinDHDanny Hermelin
- Yuval ItzhakiYIYuval Itzhaki
- Hendrik MolterHMHendrik Molter
- Dvir ShabtayDSDvir Shabtay
- 29 March 2024
- journal article
- research article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 144
Abstract
No abstract availableKeywords
Funding Information
- Deutsche Forschungsgemeinschaft (NI 369/17)
- European Research Council (949707)
- European Research Council
- Israel Science Foundation (1070/20, 1456/18)
This publication has 29 references indexed in Scilit:
- Inductive $k$ k -independent graphs and c-colorable subgraphs in scheduling: a reviewJournal of Scheduling, 2018
- A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slackJournal of Scheduling, 2016
- Interval scheduling and colorful independent setsJournal of Scheduling, 2014
- Just-in-time scheduling with controllable processing times on parallel machinesJournal of Combinatorial Optimization, 2009
- Interval scheduling: A surveyNaval Research Logistics (NRL), 2007
- Maximizing Weighted number of Just-in-Time Jobs on Unrelated Parallel MachinesJournal of Scheduling, 2005
- Which Problems Have Strongly Exponential Complexity?Journal of Computer and System Sciences, 2001
- On the Complexity of k-SATJournal of Computer and System Sciences, 2001
- On the approximability of an interval scheduling problemJournal of Scheduling, 1999
- Interval Scheduling on identical machinesJournal of Global Optimization, 1996