Unary NP-hardness of minimizing total weighted tardiness with generalized due dates
Author:
Funder
NSFC
NSF-Henan
Publisher
Elsevier BV
Subject
Applied Mathematics,Industrial and Manufacturing Engineering,Management Science and Operations Research,Software
Reference7 articles.
1. Minimizing total tardiness on one machine is NP-hard;Du;Math. Oper. Res.,1990
2. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1979
3. Scheduling problems with generalized due dates;Hall;IIE Trans.,1986
4. On the complexity of generalized due date scheduling problems;Hall;European J. Oper. Res.,1991
5. Single machine scheduling with assignable due dates;Qi;Discrete Appl. Math.,2002
Cited by 16 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Order acceptance and scheduling with delivery under generalized parameters;Naval Research Logistics (NRL);2023-07-10
2. Minimizing tardiness scheduling measures with generalized due-dates and a maintenance activity;Computers & Operations Research;2023-04
3. Revisit the scheduling problem with assignable or generalized due dates to minimize total weighted late work;International Journal of Production Research;2022-12-30
4. Scheduling with periodic due date to minimize the maximum tardiness in lean production of medical equipment;2022 3rd International Symposium on Artificial Intelligence for Medicine Sciences;2022-10-13
5. On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates;Journal of Scheduling;2022-06-25
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3