Improved Approximation Schemes for Early Work Scheduling on Identical Parallel Machines with a Common Due Date
Author:
Funder
National Natural Science Foundation of China
Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research
Link
https://link.springer.com/content/pdf/10.1007/s40305-022-00402-y.pdf
Reference8 articles.
1. Chen, X., Liang, Y., Sterna, M., Wang, W., Błażewicz, J.: Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date. Eur. J. Oper. Res. 284(1), 67–74 (2020)
2. Sterna, M., Czerniachowska, K.: Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work. J. Optimiz. Theory. App. 174, 927–944 (2017)
3. Sterna, M.: A survey of scheduling problems with late work criteria. Omega 39(2), 120–129 (2011)
4. Chen, X., Wang, W., Xie, P., Zhang, X., Sterna, M., Błażewicz, J.: Exact and heuristic algorithms for scheduling on two identical machines with early work maximization. Comput. Ind. Eng. 144, 106449 (2020)
5. Györgyi, P., Kis, T.: A common approximation framework for early work, late work, and resource leveling problems. Eur. J. Oper. Res. 286(1), 129–137 (2020)
Cited by 9 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Semi-Online Algorithms for the Hierarchical Extensible Bin-Packing Problem and Early Work Problem;Computation;2024-04-01
2. Online and semi-online scheduling on two hierarchical machines with a common due date to maximize the total early work;International Journal of Applied Mathematics and Computer Science;2024
3. Minmax Common Due-Window Assignment Scheduling with Deteriorating Jobs;Journal of the Operations Research Society of China;2023-10-27
4. Combinatorial approximation algorithms for the maximum bounded connected bipartition problem;Journal of Combinatorial Optimization;2023-01
5. Early Work Maximization Problem on Two Machines Under a Grade of Service Provision;Proceedings of the 2022 6th International Conference on Computer Science and Artificial Intelligence;2022-12-09
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3