A Combinatorial Approximation Algorithm for the Vector Scheduling with Submodular Penalties on Parallel Machines
In this paper, we focus on solving the vector scheduling problem with submodular penalties on parallel machines. We are given n jobs and m parallel machines, where each job is associated with a d-dimensional vector. Each job can either be rejected, incurring a rejection penalty, or accepted and proc...
Saved in:
| Main Authors: | Bihui Cheng, Wencheng Wang |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2023-01-01
|
| Series: | Journal of Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2023/8886388 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Improved Combinatorial Benders Decomposition for a Scheduling Problem with Unrelated Parallel Machines
by: Francisco Regis Abreu Gomes, et al.
Published: (2017-01-01) -
Approximation Algorithms and an FPTAS for the Single Machine Problem with Biased Tardiness Penalty
by: G. Moslehi, et al.
Published: (2014-01-01) -
Stochastic Block-Coordinate Gradient Projection Algorithms for Submodular Maximization
by: Zhigang Li, et al.
Published: (2018-01-01) -
Dynamic Stepsize Techniques in DR-Submodular Maximization
by: Yanfei Li, et al.
Published: (2025-04-01) -
On Constructing Finite, Finitely Subadditive Outer Measures, and Submodularity
by: Charles Traina
Published: (2008-01-01)