Improved approximation algorithm for the parallel-machine customer order scheduling with delivery time and submodular rejection penalties

被引：0
|
作者：
Hou, Bo [1 ]
Zheng, Hongye [1 ]
Liu, Wen [1 ]
Wu, Weili [2 ]
Du, Ding-Zhu [2 ]
Gao, Suogang [1 ]
机构：
[1] Hebei Normal Univ, Sch Math Sci, Shijiazhuang 050024, Peoples R China
[2] Univ Texas Dallas, Dept Comp Sci, Richardson, TX 75080 USA
来源：
OPTIMIZATION LETTERS | 2024年 / 18卷 / 07期
关键词：
Order scheduling; Delivery time; Submodular rejection penalty; Lovasz rounding technique; Approximation algorithm;
D O I：
10.1007/s11590-023-02073-x
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
In this paper, we design a 2-approximation algorithm for the parallel-machine customer order scheduling with delivery time and submodular rejection penalties based on Lovasz rounding technique, which improves the corresponding result obtained in Zheng et al. (J. Oper. Res. Soc. China, 2022).
引用
收藏
页码：1747 / 1754
页数：8
相关论文
共 50 条
12345