A combination of parallel machine scheduling and the covering problem
From MaRDI portal
approximation algorithmcombination of optimization problemscovering problemparallel machine scheduling
Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Recommendations
- Combination of parallel machine scheduling and vertex cover
- Improved approximation algorithm for the combination of parallel machine scheduling and vertex cover
- Improved approximation algorithms for the combination problem of parallel machine scheduling and path
- Machine covering with combined partial information
- scientific article; zbMATH DE number 1182760
Cited in
(11)- Improved approximation algorithms for the combination problem of parallel machine scheduling and path
- A dynamic edge covering and scheduling problem: complexity results and approximation algorithms
- Vertex cover meets scheduling
- A multi-phase covering Pareto-optimal front method to multi-objective parallel machine scheduling
- A Robust PTAS for Machine Covering and Packing
- Parallel machine covering with limited number of preemptions
- Improved approximation algorithm for the combination of parallel machine scheduling and vertex cover
- Combination of parallel machine scheduling and vertex cover
- Approximation algorithms for the combination of prize-collecting vertex cover and scheduling
- A generalized combination of parallel machine scheduling and path
- Approximation algorithms for the integrated path and bin packing problem
This page was built for publication: A combination of parallel machine scheduling and the covering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2928419)
