A Review for Submodular Optimization on Machine Scheduling Problems
Author:
Publisher
Springer International Publishing
Link
http://link.springer.com/content/pdf/10.1007/978-3-030-41672-0_16
Reference46 articles.
1. Agnetis, A., Detti, P., Pranzo, M., Sodhi, M.S.: Sequencing unreliable jobs on parallel machines. J. Sched. 12(1), 45 (2009)
2. Arbib, C., Felici, G., Servilio, M.: Common operation scheduling with general processing times: a branch-and-cut algorithm to minimize the weighted number of tardy jobs. Omega 84, 18–30 (2019)
3. Bambagini, M., Lelli, J., Buttazzo, G., Lipari, G.: On the energy-aware partitioning of real-time tasks on homogeneous multi-processor systems. In: 2013 4th Annual International Conference on Energy Aware Computing Systems and Applications (ICEAC), pp. 69–74. IEEE (2013)
4. Bampis, E., Letsios, D., Lucarelli, G.: Green scheduling, flows and matchings. Theor. Comput. Sci. 579, 126–136 (2015)
5. Belov, G., Scheithauer, G.: Setup and open-stacks minimization in one-dimensional stock cutting. INFORMS J. Comput. 19(1), 27–35 (2007)
Cited by 5 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A theoretical and empirical study of job scheduling in cloud computing environments: the weighted completion time minimization problem with capacitated parallel machines;Annals of Operations Research;2023-10-19
2. Efficient Streaming Algorithms for Maximizing Monotone DR-Submodular Function on the Integer Lattice;Mathematics;2022-10-13
3. A new performance bound for submodular maximization problems and its application to multi-agent optimal coverage problems;Automatica;2022-10
4. On a Reduction for a Class of Resource Allocation Problems;INFORMS Journal on Computing;2021-12-29
5. Weighted Completion Time Minimization for Capacitated Parallel Machines;Approximation and Online Algorithms;2021
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3