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...
Main Authors: | Bihui Cheng, Wencheng Wang |
---|---|
格式: | 文件 |
语言: | English |
出版: |
Hindawi Limited
2023-01-01
|
丛编: | Journal of Mathematics |
在线阅读: | http://dx.doi.org/10.1155/2023/8886388 |
相似书籍
-
A Combinatorial 2-Approximation Algorithm for the Parallel-Machine Scheduling with Release Times and Submodular Penalties
由: Wencheng Wang, et al.
出版: (2021-12-01) -
Approximation Algorithms for the Submodular Load Balancing with Submodular Penalties
由: Xiaofei Liu, et al.
出版: (2020-10-01) -
Approximation Algorithm for the Single Machine Scheduling Problem with Release Dates and Submodular Rejection Penalty
由: Xiaofei Liu, et al.
出版: (2020-01-01) -
An Improved Approximation Algorithm for the Minimum Power Cover Problem with Submodular Penalty
由: Han Dai
出版: (2022-10-01) -
A simple combinatorial algorithm for submodular function minimization
由: Iwata, Satoru, et al.
出版: (2011)