Pages that link to "Item:Q2047204"
From MaRDI portal
The following pages link to Approximation algorithms for the multiprocessor scheduling with submodular penalties (Q2047204):
Displaying 12 items.
- Approximation algorithm for the parallel-machine scheduling problem with release dates and submodular rejection penalties (Q2168731) (← links)
- Approximation algorithms for the minimum power cover problem with submodular/linear penalties (Q2672626) (← links)
- Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra (Q2931828) (← links)
- A Review for Submodular Optimization on Machine Scheduling Problems (Q3297835) (← links)
- Approximately Supermodular Scheduling Subject to Matroid Constraints (Q5090799) (← links)
- On Submodular Search and Machine Scheduling (Q5108249) (← links)
- Data Center Scheduling, Generalized Flows, and Submodularity (Q5194678) (← links)
- Algorithms for single machine scheduling problem with release dates and submodular penalties (Q6039534) (← links)
- Polynomial-time approximation schemes for a class of integrated network design and scheduling problems with parallel identical machines (Q6166913) (← links)
- On the parameterized tractability of single machine scheduling with rejection to minimize the weighted makespan (Q6535285) (← links)
- An approximation algorithm for the parallel-machine customer order scheduling with delivery time and submodular rejection penalties (Q6566793) (← links)
- \(W\)-prize-collecting scheduling problem on parallel machines (Q6646746) (← links)
