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 6 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)
- Algorithms for single machine scheduling problem with release dates and submodular penalties (Q6039534) (← 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)
