scientific article; zbMATH DE number 6820261
From MaRDI portal
Publication:4598212
Recommendations
- Closing the gap for makespan scheduling via sparsification techniques
- Optimal makespan scheduling with given bounds of processing times
- Competitive-ratio approximation schemes for makespan scheduling problems
- Minimizing the makespan in nonpreemptive parallel machine scheduling problem
- Accelerating the calculation of makespan used in scheduling improvement heuristics
- On the fine-grained parameterized complexity of partial scheduling to minimize the makespan
- On the fine-grained parameterized complexity of partial scheduling to minimize the makespan
- scientific article; zbMATH DE number 7740908
- Approximation schemes for robust makespan scheduling problems
Cited in
(26)- On the optimality of exact and approximation algorithms for scheduling problems
- Vector scheduling with rejection on a single machine
- An EPTAS for scheduling fork-join graphs with communication delay
- Approximation algorithms for the multiprocessor scheduling with submodular penalties
- Improved approximation algorithms for the combination problem of parallel machine scheduling and path
- A unified framework for designing EPTAS for load balancing on parallel machines
- An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops
- On the extension complexity of scheduling polytopes
- An efficient PTAS for parallel machine scheduling with capacity constraints
- Closing the gap for makespan scheduling via sparsification techniques
- The support of integer optimal solutions
- Symmetry exploitation for online machine covering with bounded migration
- Closing the Gap for Pseudo-Polynomial Strip Packing
- On integer programming and convolution
- Empowering the configuration-IP -- new PTAS results for scheduling with setups times
- On minimizing the makespan when some jobs cannot be assigned on the same machine
- New algorithmic results for bin packing and scheduling
- On the optimality of approximation schemes for the classical scheduling problem
- Streaming algorithms for bin packing and vector scheduling
- An efficient PTAS for stochastic load balancing with Poisson jobs
- New support size bounds for integer programming, applied to makespan minimization on uniformly related machines
- Minimum-norm load balancing Is (almost) as easy as minimizing makespan
- Mathematical programming approaches for social welfare maximization
- Tightness of sensitivity and proximity bounds for integer linear programs
- Approximation schemes for the generalized extensible bin packing problem
- An APTAS for bin packing with clique-graph conflicts
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4598212)
