On the complexity of scheduling problems with a fixed number of parallel identical machines
From MaRDI portal
Publication:6169524
DOI10.1007/978-3-031-23101-8_13arXiv2202.07932OpenAlexW4313429647MaRDI QIDQ6169524
Publication date: 14 August 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2202.07932
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Scheduling and fixed-parameter tractability
- Single-machine scheduling under the job rejection constraint
- Scheduling for parallel processing
- Fast approximation algorithm for job sequencing with deadlines
- A new dynamic programming algorithm for the parallel machines total weighted completion time problem
- Parameterized complexity of machine scheduling: 15 open problems
- Scheduling lower bounds via AND subset sum
- Scheduling meets \(n\)-fold integer programming
- Complexity of Scheduling Parallel Task Systems
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- On Problems Equivalent to (min,+)-Convolution
- Scheduling independent tasks to reduce mean finishing time
- Reducibility among Combinatorial Problems
- SETH-Based Lower Bounds for Subset Sum and Bicriteria Path
- A Subquadratic Approximation Scheme for Partition
- On the optimality of approximation schemes for the classical scheduling problem
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- Bounding the Running Time of Algorithms for Scheduling and Packing Problems
- Complexity and inapproximability results for parallel task scheduling and strip packing
- On the complexity of \(k\)-SAT
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the complexity of scheduling problems with a fixed number of parallel identical machines
