A Branch-and-Bound Algorithm for the Prize-Collecting Single-Machine Scheduling Problem with Deadlines and Total Tardiness Minimization
Author:
Affiliation:
1. Dipartimento di Informatica, Università degli Studi di Milano, 26013 Crema, Italy
2. Computer Science Department, University of Turin, I-10149 Torino, Italy
Publisher
Institute for Operations Research and the Management Sciences (INFORMS)
Subject
General Engineering
Reference16 articles.
1. OR-Library: Distributing Test Problems by Electronic Mail
2. Planning and scheduling algorithms for the COSMO-SkyMed constellation
3. A Review of Machine Scheduling: Complexity, Algorithms and Approximability
4. Solving Parallel Machine Scheduling Problems by Column Generation
5. A time indexed formulation of non-preemptive single machine scheduling problems
Cited by 10 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A novel exact formulation for parallel machine scheduling problems;Computers & Chemical Engineering;2024-05
2. A matheuristic for the generalized order acceptance and scheduling problem;European Journal of Operational Research;2022-05
3. Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates;Journal of Scheduling;2021-07-26
4. Parallel Machine Scheduling with Due Date-to-Deadline Window, Order Sharing and Time Value of Money;Asia-Pacific Journal of Operational Research;2021-06-28
5. A∗-based construction of decision diagrams for a prize-collecting scheduling problem;Computers & Operations Research;2021-02
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3