Scheduling problems with rejection to minimize the k-th power of the makespan plus the total rejection cost-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Scheduling problems with rejection to minimize the k-th power of the makespan plus the total rejection cost

Published:2023-08 Issue:1 Volume:46 Page:
ISSN:1382-6905
Container-title:Journal of Combinatorial Optimization
language:en
Short-container-title:J Comb Optim

Author:

Lu Lingfa^ORCID,Zhang Liqi

Funder

National Natural Science Foundation of China

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications

Link

https://link.springer.com/content/pdf/10.1007/s10878-023-01074-x.pdf

Reference24 articles.

1. Atsmony M, Mosheiov G (2023) Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection. J Sched 26:193–207

2. Bartal Y, Leonard S, Spaccamela AM, Sgall J, Stougie L (2000) Multi-processor Scheduling with Scheduling problems with rejection. SIAM J Discret Math 13:64–78

3. Chen RX, Li SS (2020) Minimizing maximum delivery completion time for order scheduling with rejection. J Comb Optim 40:1–21

4. Garey MR, Johnson DS (1979) Computers and intractablity: a guide to the theory of NP-completeness. Freeman, San Francisco, CA

5. Hermelin D, Pinedo M, Shabtay D, Talmon N (2019) On the parameterized tractability of a single machine scheduling with rejection. Eur J Oper Res 273:67–73

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP