Bounding the running time of algorithms for scheduling and packing problems
From MaRDI portal
Recommendations
- Bounding the running time of algorithms for scheduling and packing problems
- On the optimality of exact and approximation algorithms for scheduling problems
- On the optimality of approximation schemes for the classical scheduling problem
- Approximating vector scheduling: almost matching upper and lower bounds
- Approximation algorithms for scheduling and packing problems
Cites work
- A Dynamic Programming Approach to Sequencing Problems
- A Fast Approximation Scheme for the Multiple Knapsack Problem
- A simplified NP-complete satisfiability problem
- Approximation algorithms for knapsack problems with cardinality constraints
- Approximation algorithms for scheduling parallel jobs
- Bin packing with fixed number of bins revisited
- Complexity of Scheduling Parallel Task Systems
- Complexity of Scheduling under Precedence Constraints
- Complexity theory. Limits of the efficiency of algorithms
- Computing optimal preemptive schedules for parallel tasks: linear programming approaches
- Computing Partitions with Applications to the Knapsack Problem
- Exact exponential algorithms.
- Flowshop and Jobshop Schedules: Complexity and Approximation
- scientific article; zbMATH DE number 5764783 (Why is no real title available?)
- scientific article; zbMATH DE number 3550182 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Lower bounds based on the exponential time hypothesis
- Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops
- Non-approximability results for scheduling problems with minsum criteria
- On the complexity of k-SAT
- On the complexity of multiprocessor task scheduling
- On the computational hardness based on linear fpt-reductions
- On the optimality of approximation schemes for the classical scheduling problem
- On the possibility of faster \textsc{SAT} algorithms
- Open Shop Scheduling to Minimize Finish Time
- Optimal two- and three-stage production schedules with set-up time included
- Parametrized complexity theory.
- Scheduling Multiprocessor Tasks to Minimize Schedule Length
- Short Shop Schedules
- The Complexity of Flowshop and Jobshop Scheduling
- There is no EPTAS for two-dimensional knapsack
- Which problems have strongly exponential complexity?
Cited in
(17)- Tight approximations for resource constrained scheduling and bin packing
- On the optimality of exact and approximation algorithms for scheduling problems
- Scheduling lower bounds via AND subset sum
- On the fine-grained parameterized complexity of partial scheduling to minimize the makespan
- Non-preemptive scheduling in a smart grid model and its implications on machine minimization
- Four decades of research on the open-shop scheduling problem to minimize the makespan
- On the weak computability of a four dimensional orthogonal packing and time scheduling problem
- Bounding the running time of algorithms for scheduling and packing problems
- scientific article; zbMATH DE number 7764108 (Why is no real title available?)
- On the complexity of scheduling problems with a fixed number of parallel identical machines
- When can cluster deletion with bounded weights be solved efficiently?
- No polynomial kernels for knapsack
- Further parameterized results on weak Grundy coloring
- Classical and quantum algorithms for variants of subset-sum via dynamic programming
- When can cluster deletion with bounded weights be solved efficiently?
- Parameterized hardness results for the \textsc{Restricted Santa Claus Problem}
- Exact algorithms for allocation problems
This page was built for publication: Bounding the running time of algorithms for scheduling and packing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5890508)
