On the parameterized complexity of interval scheduling with eligible machine sets
From MaRDI portal
Publication:6564614
DOI10.1016/J.JCSS.2024.103533MaRDI QIDQ6564614
Hendrik Molter, Dvir Shabtay, Yuval Itzhaki, Danny Hermelin
Publication date: 1 July 2024
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
fixed-parameter tractabilityjust-in-time schedulinginterval scheduling\textsf{W[1}-hardness]eligible machine sets
Cites Work
- Optimal interval scheduling with a resource constraint
- The just-in-time scheduling problem in a flow-shop scheduling system
- Interval scheduling on related machines
- A simplified NP-complete satisfiability problem
- Fixed interval scheduling: models, applications, computational complexity and algorithms
- Maximizing weighted number of just-in-time jobs on unrelated parallel machines
- Interval scheduling and colorful independent sets
- Just-in-time scheduling with controllable processing times on parallel machines
- On the parameterized complexity of multiple-interval graph problems
- Scheduling jobs with fixed start and end times
- The maximum k-colorable subgraph problem for chordal graphs
- Precoloring extension. I: Interval graphs
- Which problems have strongly exponential complexity?
- Parameterized complexity of machine scheduling: 15 open problems
- On the approximability of an interval scheduling problem
- On the \(k\)-coloring of intervals
- Single machine scheduling to minimize the number of early and tardy jobs
- Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review
- A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines
- A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack
- Precoloring extension on unit interval graphs
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Interval scheduling on identical machines
- Sequencing with Earliness and Tardiness Penalties: A Review
- Interval scheduling: A survey
- Algorithmic Aspects of Vertex Elimination on Graphs
- On the complexity of \(k\)-SAT
- Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs
This page was built for publication: On the parameterized complexity of interval scheduling with eligible machine sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6564614)